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-1ae3202 [2019-03-04 16:52:55,900 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-03-04 16:52:55,902 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-03-04 16:52:55,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-03-04 16:52:55,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-03-04 16:52:55,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-03-04 16:52:55,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-03-04 16:52:55,919 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-03-04 16:52:55,921 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-03-04 16:52:55,922 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-03-04 16:52:55,923 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-03-04 16:52:55,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-03-04 16:52:55,924 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-03-04 16:52:55,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-03-04 16:52:55,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-03-04 16:52:55,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-03-04 16:52:55,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-03-04 16:52:55,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-03-04 16:52:55,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-03-04 16:52:55,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-03-04 16:52:55,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-03-04 16:52:55,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-03-04 16:52:55,950 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-03-04 16:52:55,950 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-03-04 16:52:55,953 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-03-04 16:52:55,957 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-03-04 16:52:55,958 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-03-04 16:52:55,959 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-03-04 16:52:55,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-03-04 16:52:55,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-03-04 16:52:55,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-03-04 16:52:55,965 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-03-04 16:52:55,966 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-03-04 16:52:55,967 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-03-04 16:52:55,969 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-03-04 16:52:55,970 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-03-04 16:52:55,970 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-03-04 16:52:55,999 INFO L110 SettingsManager]: Loading preferences was successful [2019-03-04 16:52:55,999 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-03-04 16:52:56,000 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-03-04 16:52:56,000 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-03-04 16:52:56,000 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-03-04 16:52:56,001 INFO L133 SettingsManager]: * User list type=DISABLED [2019-03-04 16:52:56,001 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-03-04 16:52:56,001 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-03-04 16:52:56,001 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-03-04 16:52:56,002 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-03-04 16:52:56,002 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-03-04 16:52:56,002 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-03-04 16:52:56,002 INFO L133 SettingsManager]: * Interval Domain=false [2019-03-04 16:52:56,003 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-03-04 16:52:56,003 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-03-04 16:52:56,003 INFO L133 SettingsManager]: * Use SBE=true [2019-03-04 16:52:56,003 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-03-04 16:52:56,005 INFO L133 SettingsManager]: * sizeof long=4 [2019-03-04 16:52:56,005 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-03-04 16:52:56,005 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-03-04 16:52:56,005 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-03-04 16:52:56,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-03-04 16:52:56,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-03-04 16:52:56,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-03-04 16:52:56,008 INFO L133 SettingsManager]: * sizeof long double=12 [2019-03-04 16:52:56,009 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-03-04 16:52:56,009 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-03-04 16:52:56,009 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-03-04 16:52:56,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-03-04 16:52:56,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-03-04 16:52:56,010 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-03-04 16:52:56,011 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-03-04 16:52:56,011 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-03-04 16:52:56,011 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-03-04 16:52:56,011 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-03-04 16:52:56,011 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-03-04 16:52:56,012 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-03-04 16:52:56,012 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-03-04 16:52:56,012 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-03-04 16:52:56,051 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-03-04 16:52:56,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-03-04 16:52:56,068 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-03-04 16:52:56,069 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-03-04 16:52:56,070 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-03-04 16:52:56,071 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2019-03-04 16:52:56,071 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2019-03-04 16:52:56,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-03-04 16:52:56,103 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-03-04 16:52:56,104 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-03-04 16:52:56,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-03-04 16:52:56,105 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-03-04 16:52:56,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-03-04 16:52:56,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-03-04 16:52:56,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-03-04 16:52:56,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-03-04 16:52:56,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,161 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/1) ... [2019-03-04 16:52:56,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-03-04 16:52:56,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-03-04 16:52:56,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-03-04 16:52:56,170 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-03-04 16:52:56,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (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-03-04 16:52:56,244 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-03-04 16:52:56,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-03-04 16:52:56,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-03-04 16:52:56,459 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-03-04 16:52:56,460 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-03-04 16:52:56,461 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:52:56 BoogieIcfgContainer [2019-03-04 16:52:56,461 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-03-04 16:52:56,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-03-04 16:52:56,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-03-04 16:52:56,465 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-03-04 16:52:56,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.03 04:52:56" (1/2) ... [2019-03-04 16:52:56,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0c907f and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:52:56, skipping insertion in model container [2019-03-04 16:52:56,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.03 04:52:56" (2/2) ... [2019-03-04 16:52:56,469 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2019-03-04 16:52:56,479 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-03-04 16:52:56,487 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-03-04 16:52:56,504 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-03-04 16:52:56,536 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-03-04 16:52:56,536 INFO L383 AbstractCegarLoop]: Hoare is true [2019-03-04 16:52:56,537 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-03-04 16:52:56,537 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-03-04 16:52:56,537 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-03-04 16:52:56,537 INFO L387 AbstractCegarLoop]: Difference is false [2019-03-04 16:52:56,537 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-03-04 16:52:56,538 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-03-04 16:52:56,553 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2019-03-04 16:52:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-03-04 16:52:56,559 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:56,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-03-04 16:52:56,566 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:56,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:56,576 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2019-03-04 16:52:56,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:56,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:56,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:56,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:56,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:56,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:52:56,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:52:56,818 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:52:56,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:52:56,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:52:56,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:52:56,855 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2019-03-04 16:52:57,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:57,014 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2019-03-04 16:52:57,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:52:57,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-03-04 16:52:57,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:57,028 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:52:57,029 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:52:57,032 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-03-04 16:52:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:52:57,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2019-03-04 16:52:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-03-04 16:52:57,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2019-03-04 16:52:57,069 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2019-03-04 16:52:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:57,070 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-03-04 16:52:57,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:52:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2019-03-04 16:52:57,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:52:57,071 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:57,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:52:57,072 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:57,072 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2019-03-04 16:52:57,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:57,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:57,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:57,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:57,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:52:57,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-03-04 16:52:57,361 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:52:57,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-03-04 16:52:57,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-03-04 16:52:57,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-03-04 16:52:57,365 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2019-03-04 16:52:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:57,485 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2019-03-04 16:52:57,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-03-04 16:52:57,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-03-04 16:52:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:57,487 INFO L225 Difference]: With dead ends: 25 [2019-03-04 16:52:57,488 INFO L226 Difference]: Without dead ends: 23 [2019-03-04 16:52:57,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-03-04 16:52:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-03-04 16:52:57,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2019-03-04 16:52:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-03-04 16:52:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-03-04 16:52:57,495 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2019-03-04 16:52:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:57,496 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-03-04 16:52:57,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-03-04 16:52:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2019-03-04 16:52:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:52:57,497 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:57,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:52:57,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2019-03-04 16:52:57,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-03-04 16:52:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-03-04 16:52:57,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-03-04 16:52:57,560 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-03-04 16:52:57,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-03-04 16:52:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-03-04 16:52:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-03-04 16:52:57,562 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2019-03-04 16:52:57,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:57,610 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2019-03-04 16:52:57,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-03-04 16:52:57,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-03-04 16:52:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:57,612 INFO L225 Difference]: With dead ends: 24 [2019-03-04 16:52:57,612 INFO L226 Difference]: Without dead ends: 13 [2019-03-04 16:52:57,613 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-03-04 16:52:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-03-04 16:52:57,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-03-04 16:52:57,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-03-04 16:52:57,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-03-04 16:52:57,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2019-03-04 16:52:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:57,616 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-03-04 16:52:57,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-03-04 16:52:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-03-04 16:52:57,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-03-04 16:52:57,617 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:57,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:52:57,618 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:57,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:57,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2019-03-04 16:52:57,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:57,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:57,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:57,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:58,000 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-03-04 16:52:58,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:58,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:58,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:52:58,054 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-03-04 16:52:58,056 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2019-03-04 16:52:58,116 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:52:58,116 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:52:58,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:52:58,305 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-03-04 16:52:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:58,313 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:52:58,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:58,313 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-03-04 16:52:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:58,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:52:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:58,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 7 conjunts are in the unsatisfiable core [2019-03-04 16:52:58,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:52:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:58,450 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:52:58,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:58,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:52:58,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2019-03-04 16:52:58,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:52:58,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-03-04 16:52:58,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-03-04 16:52:58,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-03-04 16:52:58,577 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2019-03-04 16:52:58,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:58,825 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2019-03-04 16:52:58,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-03-04 16:52:58,829 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-03-04 16:52:58,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:58,830 INFO L225 Difference]: With dead ends: 26 [2019-03-04 16:52:58,830 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:52:58,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-03-04 16:52:58,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:52:58,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2019-03-04 16:52:58,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-03-04 16:52:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-03-04 16:52:58,835 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-03-04 16:52:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-03-04 16:52:58,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-03-04 16:52:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-03-04 16:52:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-03-04 16:52:58,836 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:58,836 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:52:58,836 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:58,837 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2019-03-04 16:52:58,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:58,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:58,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:58,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:58,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:58,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:58,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:52:58,899 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2019-03-04 16:52:58,899 INFO L207 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2019-03-04 16:52:58,902 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-03-04 16:52:58,902 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-03-04 16:52:59,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-03-04 16:52:59,083 INFO L272 AbstractInterpreter]: Visited 12 different actions 98 times. Merged at 11 different actions 71 times. Widened at 3 different actions 7 times. Found 17 fixpoints after 6 different actions. Largest state had 0 variables. [2019-03-04 16:52:59,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:59,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-03-04 16:52:59,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:59,086 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-03-04 16:52:59,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:59,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:52:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:59,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2019-03-04 16:52:59,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:52:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:59,198 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:52:59,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:59,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:52:59,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2019-03-04 16:52:59,251 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:52:59,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-03-04 16:52:59,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-03-04 16:52:59,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-03-04 16:52:59,252 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2019-03-04 16:52:59,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:52:59,654 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-03-04 16:52:59,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-03-04 16:52:59,654 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-03-04 16:52:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:52:59,655 INFO L225 Difference]: With dead ends: 31 [2019-03-04 16:52:59,655 INFO L226 Difference]: Without dead ends: 19 [2019-03-04 16:52:59,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-03-04 16:52:59,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-03-04 16:52:59,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-03-04 16:52:59,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-03-04 16:52:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2019-03-04 16:52:59,661 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2019-03-04 16:52:59,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:52:59,661 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2019-03-04 16:52:59,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-03-04 16:52:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2019-03-04 16:52:59,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-03-04 16:52:59,662 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:52:59,662 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-03-04 16:52:59,662 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:52:59,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:52:59,663 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2019-03-04 16:52:59,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:52:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:59,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:52:59,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:52:59,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:52:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:52:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:52:59,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:52:59,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:52:59,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:52:59,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:52:59,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:00,000 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-03-04 16:53:00,021 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:00,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:00,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-03-04 16:53:00,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:00,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 11 conjunts are in the unsatisfiable core [2019-03-04 16:53:00,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:00,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:00,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:00,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2019-03-04 16:53:00,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:00,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:53:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:53:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:00,197 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2019-03-04 16:53:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:00,509 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2019-03-04 16:53:00,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-03-04 16:53:00,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-03-04 16:53:00,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:00,511 INFO L225 Difference]: With dead ends: 35 [2019-03-04 16:53:00,512 INFO L226 Difference]: Without dead ends: 28 [2019-03-04 16:53:00,512 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-03-04 16:53:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-03-04 16:53:00,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-03-04 16:53:00,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-03-04 16:53:00,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2019-03-04 16:53:00,517 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2019-03-04 16:53:00,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:00,517 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2019-03-04 16:53:00,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:53:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2019-03-04 16:53:00,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-03-04 16:53:00,518 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:00,518 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-03-04 16:53:00,519 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:00,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2019-03-04 16:53:00,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:00,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:00,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:00,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:00,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:00,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:00,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:00,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:00,699 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-03-04 16:53:00,710 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:00,710 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:00,716 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:00,716 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:00,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2019-03-04 16:53:00,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:00,764 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:00,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:00,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:00,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:00,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2019-03-04 16:53:00,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:00,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-03-04 16:53:00,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-03-04 16:53:00,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-03-04 16:53:00,849 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2019-03-04 16:53:00,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:00,956 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2019-03-04 16:53:00,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-03-04 16:53:00,957 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-03-04 16:53:00,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:00,958 INFO L225 Difference]: With dead ends: 45 [2019-03-04 16:53:00,958 INFO L226 Difference]: Without dead ends: 26 [2019-03-04 16:53:00,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:00,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-03-04 16:53:00,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-03-04 16:53:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-03-04 16:53:00,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-03-04 16:53:00,964 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2019-03-04 16:53:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:00,964 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-03-04 16:53:00,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-03-04 16:53:00,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-03-04 16:53:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-03-04 16:53:00,965 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:00,965 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2019-03-04 16:53:00,966 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:00,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2019-03-04 16:53:00,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:00,967 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:00,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:00,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:01,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:01,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:01,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:01,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:01,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:01,187 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-03-04 16:53:01,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:01,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:01,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 15 conjunts are in the unsatisfiable core [2019-03-04 16:53:01,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:01,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:01,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:01,357 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:01,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:01,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2019-03-04 16:53:01,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:01,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:53:01,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:53:01,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:01,377 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2019-03-04 16:53:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:01,769 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-03-04 16:53:01,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-03-04 16:53:01,770 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2019-03-04 16:53:01,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:01,771 INFO L225 Difference]: With dead ends: 49 [2019-03-04 16:53:01,771 INFO L226 Difference]: Without dead ends: 39 [2019-03-04 16:53:01,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2019-03-04 16:53:01,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-03-04 16:53:01,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-03-04 16:53:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-03-04 16:53:01,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-03-04 16:53:01,777 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2019-03-04 16:53:01,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:01,778 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-03-04 16:53:01,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:53:01,778 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-03-04 16:53:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-03-04 16:53:01,779 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:01,779 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2019-03-04 16:53:01,779 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:01,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2019-03-04 16:53:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:01,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:01,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:01,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:01,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:01,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:01,990 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:01,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:01,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:01,990 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-03-04 16:53:02,001 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:02,001 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:02,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-03-04 16:53:02,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:02,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 10 conjunts are in the unsatisfiable core [2019-03-04 16:53:02,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:02,159 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:02,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2019-03-04 16:53:02,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:02,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-03-04 16:53:02,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-03-04 16:53:02,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-03-04 16:53:02,190 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2019-03-04 16:53:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:02,516 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2019-03-04 16:53:02,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-03-04 16:53:02,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-03-04 16:53:02,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:02,517 INFO L225 Difference]: With dead ends: 60 [2019-03-04 16:53:02,517 INFO L226 Difference]: Without dead ends: 33 [2019-03-04 16:53:02,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2019-03-04 16:53:02,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-03-04 16:53:02,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-03-04 16:53:02,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-03-04 16:53:02,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-03-04 16:53:02,523 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2019-03-04 16:53:02,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:02,523 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-03-04 16:53:02,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-03-04 16:53:02,523 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-03-04 16:53:02,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-03-04 16:53:02,524 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:02,524 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2019-03-04 16:53:02,525 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:02,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:02,525 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2019-03-04 16:53:02,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:02,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:02,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:02,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:02,745 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:02,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:02,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:02,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:02,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:02,746 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-03-04 16:53:02,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:02,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:02,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:02,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:02,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 19 conjunts are in the unsatisfiable core [2019-03-04 16:53:02,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:02,890 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:02,957 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:02,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:02,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2019-03-04 16:53:02,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:02,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-03-04 16:53:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-03-04 16:53:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:02,978 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2019-03-04 16:53:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:03,910 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2019-03-04 16:53:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-03-04 16:53:03,910 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2019-03-04 16:53:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:03,911 INFO L225 Difference]: With dead ends: 64 [2019-03-04 16:53:03,911 INFO L226 Difference]: Without dead ends: 50 [2019-03-04 16:53:03,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2019-03-04 16:53:03,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-03-04 16:53:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-03-04 16:53:03,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-03-04 16:53:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2019-03-04 16:53:03,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2019-03-04 16:53:03,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:03,918 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2019-03-04 16:53:03,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-03-04 16:53:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2019-03-04 16:53:03,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-03-04 16:53:03,920 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:03,920 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:53:03,920 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:03,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2019-03-04 16:53:03,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,922 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:03,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,397 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:04,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:04,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:04,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:04,398 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-03-04 16:53:04,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:04,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:04,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2019-03-04 16:53:04,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:04,517 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,518 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:04,615 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:04,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:04,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2019-03-04 16:53:04,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:04,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-03-04 16:53:04,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-03-04 16:53:04,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-03-04 16:53:04,636 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2019-03-04 16:53:04,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:04,924 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2019-03-04 16:53:04,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-03-04 16:53:04,925 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2019-03-04 16:53:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:04,926 INFO L225 Difference]: With dead ends: 75 [2019-03-04 16:53:04,926 INFO L226 Difference]: Without dead ends: 40 [2019-03-04 16:53:04,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-03-04 16:53:04,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-03-04 16:53:04,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2019-03-04 16:53:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-03-04 16:53:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2019-03-04 16:53:04,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2019-03-04 16:53:04,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:04,934 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2019-03-04 16:53:04,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-03-04 16:53:04,934 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2019-03-04 16:53:04,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-03-04 16:53:04,935 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:04,935 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2019-03-04 16:53:04,935 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:04,935 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2019-03-04 16:53:04,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:04,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:04,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:05,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:05,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:05,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:05,213 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-03-04 16:53:05,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:05,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:05,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-03-04 16:53:05,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:05,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:53:05,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:05,661 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:06,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:06,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2019-03-04 16:53:06,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:06,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-03-04 16:53:06,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-03-04 16:53:06,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2019-03-04 16:53:06,548 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2019-03-04 16:53:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:08,784 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-03-04 16:53:08,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-03-04 16:53:08,784 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2019-03-04 16:53:08,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:08,785 INFO L225 Difference]: With dead ends: 97 [2019-03-04 16:53:08,785 INFO L226 Difference]: Without dead ends: 58 [2019-03-04 16:53:08,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2019-03-04 16:53:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-03-04 16:53:08,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2019-03-04 16:53:08,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-03-04 16:53:08,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-03-04 16:53:08,795 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2019-03-04 16:53:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:08,795 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-03-04 16:53:08,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-03-04 16:53:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-03-04 16:53:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-03-04 16:53:08,796 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:08,797 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2019-03-04 16:53:08,797 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:08,797 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2019-03-04 16:53:08,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:08,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:08,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:08,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:08,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:08,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:09,224 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:09,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:09,224 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:09,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:09,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:09,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:09,225 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-03-04 16:53:09,234 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:09,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:09,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:09,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:09,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 27 conjunts are in the unsatisfiable core [2019-03-04 16:53:09,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:09,413 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:09,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:09,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2019-03-04 16:53:09,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:09,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-03-04 16:53:09,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-03-04 16:53:09,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:53:09,472 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2019-03-04 16:53:10,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:10,845 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2019-03-04 16:53:10,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-03-04 16:53:10,845 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-03-04 16:53:10,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:10,846 INFO L225 Difference]: With dead ends: 94 [2019-03-04 16:53:10,846 INFO L226 Difference]: Without dead ends: 72 [2019-03-04 16:53:10,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2019-03-04 16:53:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-03-04 16:53:10,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2019-03-04 16:53:10,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-03-04 16:53:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-03-04 16:53:10,855 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2019-03-04 16:53:10,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:10,856 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-03-04 16:53:10,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-03-04 16:53:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-03-04 16:53:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-03-04 16:53:10,857 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:10,857 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2019-03-04 16:53:10,857 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2019-03-04 16:53:10,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:10,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:10,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:10,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:11,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:11,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:11,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:11,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:11,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:11,056 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-03-04 16:53:11,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:11,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:11,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 16 conjunts are in the unsatisfiable core [2019-03-04 16:53:11,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:11,198 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:11,199 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:11,315 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:11,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:11,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2019-03-04 16:53:11,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-03-04 16:53:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-03-04 16:53:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2019-03-04 16:53:11,336 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2019-03-04 16:53:11,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:11,675 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2019-03-04 16:53:11,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-03-04 16:53:11,676 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2019-03-04 16:53:11,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:11,677 INFO L225 Difference]: With dead ends: 105 [2019-03-04 16:53:11,677 INFO L226 Difference]: Without dead ends: 54 [2019-03-04 16:53:11,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2019-03-04 16:53:11,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-03-04 16:53:11,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2019-03-04 16:53:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-03-04 16:53:11,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2019-03-04 16:53:11,686 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2019-03-04 16:53:11,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:11,687 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2019-03-04 16:53:11,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-03-04 16:53:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2019-03-04 16:53:11,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-03-04 16:53:11,688 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:11,688 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2019-03-04 16:53:11,688 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:11,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:11,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2019-03-04 16:53:11,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:11,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:11,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:11,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:12,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:12,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:12,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:12,051 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-03-04 16:53:12,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:12,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:12,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-03-04 16:53:12,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:12,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 31 conjunts are in the unsatisfiable core [2019-03-04 16:53:12,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:12,354 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,354 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:12,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:12,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2019-03-04 16:53:12,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:12,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:53:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:53:12,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:12,431 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2019-03-04 16:53:13,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:13,970 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-03-04 16:53:13,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-03-04 16:53:13,971 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2019-03-04 16:53:13,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:13,973 INFO L225 Difference]: With dead ends: 109 [2019-03-04 16:53:13,973 INFO L226 Difference]: Without dead ends: 83 [2019-03-04 16:53:13,975 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-03-04 16:53:13,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-03-04 16:53:13,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2019-03-04 16:53:13,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-03-04 16:53:13,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2019-03-04 16:53:13,983 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2019-03-04 16:53:13,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:13,984 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2019-03-04 16:53:13,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:53:13,984 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2019-03-04 16:53:13,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-03-04 16:53:13,985 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:13,985 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2019-03-04 16:53:13,985 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:13,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:13,986 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2019-03-04 16:53:13,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:13,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:13,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:13,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:14,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:14,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:14,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:14,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:14,192 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-03-04 16:53:14,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:14,202 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:14,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:14,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:14,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2019-03-04 16:53:14,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,372 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:14,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:14,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2019-03-04 16:53:14,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:14,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-03-04 16:53:14,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-03-04 16:53:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2019-03-04 16:53:14,495 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2019-03-04 16:53:14,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:14,873 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2019-03-04 16:53:14,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-03-04 16:53:14,874 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-03-04 16:53:14,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:14,875 INFO L225 Difference]: With dead ends: 120 [2019-03-04 16:53:14,875 INFO L226 Difference]: Without dead ends: 61 [2019-03-04 16:53:14,876 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-03-04 16:53:14,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-03-04 16:53:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2019-03-04 16:53:14,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-03-04 16:53:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2019-03-04 16:53:14,884 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2019-03-04 16:53:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:14,885 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2019-03-04 16:53:14,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-03-04 16:53:14,885 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2019-03-04 16:53:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-03-04 16:53:14,886 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:14,886 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2019-03-04 16:53:14,886 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:14,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:14,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2019-03-04 16:53:14,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:14,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:14,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:14,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:15,333 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:15,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:15,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:15,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:15,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:15,334 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-03-04 16:53:15,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:15,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:15,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:15,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 35 conjunts are in the unsatisfiable core [2019-03-04 16:53:15,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,594 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:15,670 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:15,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:15,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2019-03-04 16:53:15,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:15,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-03-04 16:53:15,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-03-04 16:53:15,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:15,690 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2019-03-04 16:53:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:17,276 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2019-03-04 16:53:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-03-04 16:53:17,276 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2019-03-04 16:53:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:17,277 INFO L225 Difference]: With dead ends: 124 [2019-03-04 16:53:17,277 INFO L226 Difference]: Without dead ends: 94 [2019-03-04 16:53:17,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2019-03-04 16:53:17,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-03-04 16:53:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2019-03-04 16:53:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-03-04 16:53:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-03-04 16:53:17,297 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2019-03-04 16:53:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:17,297 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-03-04 16:53:17,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-03-04 16:53:17,298 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-03-04 16:53:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-03-04 16:53:17,299 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:17,299 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2019-03-04 16:53:17,299 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2019-03-04 16:53:17,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:17,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:17,305 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:17,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:17,523 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:17,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:17,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:17,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:17,523 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-03-04 16:53:17,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:17,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:17,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-03-04 16:53:17,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:17,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 20 conjunts are in the unsatisfiable core [2019-03-04 16:53:17,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:17,800 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:17,943 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:17,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:17,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2019-03-04 16:53:17,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:17,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-03-04 16:53:17,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-03-04 16:53:17,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2019-03-04 16:53:17,972 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2019-03-04 16:53:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:18,524 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2019-03-04 16:53:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-03-04 16:53:18,524 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2019-03-04 16:53:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:18,525 INFO L225 Difference]: With dead ends: 135 [2019-03-04 16:53:18,525 INFO L226 Difference]: Without dead ends: 68 [2019-03-04 16:53:18,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-03-04 16:53:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-03-04 16:53:18,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-03-04 16:53:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-03-04 16:53:18,555 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2019-03-04 16:53:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:18,556 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-03-04 16:53:18,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-03-04 16:53:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-03-04 16:53:18,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-03-04 16:53:18,560 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:18,561 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2019-03-04 16:53:18,561 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:18,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:18,561 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2019-03-04 16:53:18,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:18,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:18,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:19,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:19,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:19,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:19,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:19,110 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-03-04 16:53:19,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:19,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:19,137 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:19,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:19,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 39 conjunts are in the unsatisfiable core [2019-03-04 16:53:19,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:19,447 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:19,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:19,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2019-03-04 16:53:19,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:19,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:53:19,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:53:19,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:19,548 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2019-03-04 16:53:21,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:21,411 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2019-03-04 16:53:21,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-03-04 16:53:21,411 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2019-03-04 16:53:21,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:21,413 INFO L225 Difference]: With dead ends: 139 [2019-03-04 16:53:21,413 INFO L226 Difference]: Without dead ends: 105 [2019-03-04 16:53:21,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-03-04 16:53:21,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2019-03-04 16:53:21,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-03-04 16:53:21,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-03-04 16:53:21,422 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2019-03-04 16:53:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:21,422 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-03-04 16:53:21,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:53:21,423 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-03-04 16:53:21,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-03-04 16:53:21,423 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:21,424 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2019-03-04 16:53:21,424 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:21,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:21,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2019-03-04 16:53:21,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:21,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:21,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:21,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:21,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:21,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:21,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:21,716 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:21,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:21,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:21,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 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-03-04 16:53:21,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:21,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:21,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 22 conjunts are in the unsatisfiable core [2019-03-04 16:53:21,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:22,427 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,427 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:22,590 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:22,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:22,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2019-03-04 16:53:22,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:22,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-03-04 16:53:22,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-03-04 16:53:22,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2019-03-04 16:53:22,610 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2019-03-04 16:53:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:23,005 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2019-03-04 16:53:23,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-03-04 16:53:23,006 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2019-03-04 16:53:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:23,007 INFO L225 Difference]: With dead ends: 150 [2019-03-04 16:53:23,007 INFO L226 Difference]: Without dead ends: 75 [2019-03-04 16:53:23,008 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-03-04 16:53:23,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-03-04 16:53:23,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2019-03-04 16:53:23,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-03-04 16:53:23,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2019-03-04 16:53:23,016 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2019-03-04 16:53:23,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:23,016 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2019-03-04 16:53:23,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-03-04 16:53:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2019-03-04 16:53:23,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-03-04 16:53:23,017 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:23,017 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2019-03-04 16:53:23,017 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:23,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:23,017 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2019-03-04 16:53:23,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:23,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:23,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:23,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:23,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:24,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:24,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:24,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:24,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:24,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:24,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 16:53:24,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:24,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:24,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-03-04 16:53:24,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:24,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:53:24,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:25,052 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:25,052 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:25,857 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:25,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:25,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2019-03-04 16:53:25,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:25,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:53:25,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:53:25,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:53:25,878 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2019-03-04 16:53:28,389 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-03-04 16:53:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:30,516 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2019-03-04 16:53:30,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 16:53:30,517 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2019-03-04 16:53:30,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:30,518 INFO L225 Difference]: With dead ends: 192 [2019-03-04 16:53:30,518 INFO L226 Difference]: Without dead ends: 113 [2019-03-04 16:53:30,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 16:53:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-03-04 16:53:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2019-03-04 16:53:30,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-03-04 16:53:30,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2019-03-04 16:53:30,531 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2019-03-04 16:53:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:30,531 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2019-03-04 16:53:30,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:53:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2019-03-04 16:53:30,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-03-04 16:53:30,532 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:30,532 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2019-03-04 16:53:30,532 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:30,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:30,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2019-03-04 16:53:30,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:30,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:30,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:30,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:31,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:31,718 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:31,718 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:31,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:31,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:31,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 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-03-04 16:53:31,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:31,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:31,742 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:31,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:31,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 47 conjunts are in the unsatisfiable core [2019-03-04 16:53:31,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:32,167 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,167 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:32,352 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:32,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:32,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2019-03-04 16:53:32,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:32,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:53:32,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:53:32,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:32,372 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2019-03-04 16:53:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:34,718 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2019-03-04 16:53:34,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-03-04 16:53:34,721 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2019-03-04 16:53:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:34,722 INFO L225 Difference]: With dead ends: 169 [2019-03-04 16:53:34,723 INFO L226 Difference]: Without dead ends: 127 [2019-03-04 16:53:34,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2019-03-04 16:53:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-03-04 16:53:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2019-03-04 16:53:34,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-03-04 16:53:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2019-03-04 16:53:34,733 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2019-03-04 16:53:34,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:34,733 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2019-03-04 16:53:34,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:53:34,734 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2019-03-04 16:53:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-03-04 16:53:34,734 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:34,734 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2019-03-04 16:53:34,735 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2019-03-04 16:53:34,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:34,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:34,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:34,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:34,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,028 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:35,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:35,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:35,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:35,029 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-03-04 16:53:35,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:35,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:35,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 26 conjunts are in the unsatisfiable core [2019-03-04 16:53:35,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,337 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:35,526 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:35,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:35,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2019-03-04 16:53:35,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:35,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-03-04 16:53:35,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-03-04 16:53:35,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2019-03-04 16:53:35,546 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2019-03-04 16:53:36,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:36,086 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2019-03-04 16:53:36,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-03-04 16:53:36,087 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2019-03-04 16:53:36,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:36,088 INFO L225 Difference]: With dead ends: 180 [2019-03-04 16:53:36,088 INFO L226 Difference]: Without dead ends: 89 [2019-03-04 16:53:36,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:53:36,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-03-04 16:53:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2019-03-04 16:53:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-03-04 16:53:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2019-03-04 16:53:36,099 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2019-03-04 16:53:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:36,099 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2019-03-04 16:53:36,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-03-04 16:53:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2019-03-04 16:53:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-03-04 16:53:36,100 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:36,101 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2019-03-04 16:53:36,101 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2019-03-04 16:53:36,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:36,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:36,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:36,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:36,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:36,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:36,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:36,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:36,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:36,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:36,669 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-03-04 16:53:36,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:36,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:36,701 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-03-04 16:53:36,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:36,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 30 conjunts are in the unsatisfiable core [2019-03-04 16:53:36,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:37,758 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:38,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:38,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2019-03-04 16:53:38,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:38,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-03-04 16:53:38,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-03-04 16:53:38,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2019-03-04 16:53:38,730 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2019-03-04 16:53:44,052 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 19 [2019-03-04 16:53:45,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:45,486 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2019-03-04 16:53:45,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-03-04 16:53:45,487 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2019-03-04 16:53:45,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:45,488 INFO L225 Difference]: With dead ends: 230 [2019-03-04 16:53:45,488 INFO L226 Difference]: Without dead ends: 135 [2019-03-04 16:53:45,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2019-03-04 16:53:45,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-03-04 16:53:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2019-03-04 16:53:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-03-04 16:53:45,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-03-04 16:53:45,506 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2019-03-04 16:53:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:45,506 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-03-04 16:53:45,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-03-04 16:53:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-03-04 16:53:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-03-04 16:53:45,507 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:45,507 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2019-03-04 16:53:45,507 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:45,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:45,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2019-03-04 16:53:45,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:45,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:45,508 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:46,553 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:46,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:46,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:46,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:46,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:46,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:46,554 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-03-04 16:53:46,565 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:46,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:46,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:46,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:46,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 55 conjunts are in the unsatisfiable core [2019-03-04 16:53:46,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:47,096 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:47,170 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:47,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:47,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2019-03-04 16:53:47,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:47,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:53:47,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:53:47,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:47,190 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2019-03-04 16:53:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:50,496 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2019-03-04 16:53:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-03-04 16:53:50,497 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2019-03-04 16:53:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:50,498 INFO L225 Difference]: With dead ends: 199 [2019-03-04 16:53:50,498 INFO L226 Difference]: Without dead ends: 149 [2019-03-04 16:53:50,498 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-03-04 16:53:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-03-04 16:53:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2019-03-04 16:53:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-03-04 16:53:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-03-04 16:53:50,513 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2019-03-04 16:53:50,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:50,513 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-03-04 16:53:50,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:53:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-03-04 16:53:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-03-04 16:53:50,514 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:50,514 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2019-03-04 16:53:50,514 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2019-03-04 16:53:50,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:50,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:50,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:50,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:50,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:50,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:50,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:50,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:50,854 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-03-04 16:53:50,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:50,866 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:53:50,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:50,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 30 conjunts are in the unsatisfiable core [2019-03-04 16:53:50,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:51,241 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,241 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:51,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:51,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2019-03-04 16:53:51,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:51,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-03-04 16:53:51,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-03-04 16:53:51,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2019-03-04 16:53:51,927 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2019-03-04 16:53:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:52,597 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2019-03-04 16:53:52,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-03-04 16:53:52,597 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2019-03-04 16:53:52,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:52,598 INFO L225 Difference]: With dead ends: 210 [2019-03-04 16:53:52,599 INFO L226 Difference]: Without dead ends: 103 [2019-03-04 16:53:52,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2019-03-04 16:53:52,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-03-04 16:53:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2019-03-04 16:53:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-03-04 16:53:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2019-03-04 16:53:52,614 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2019-03-04 16:53:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:52,614 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2019-03-04 16:53:52,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-03-04 16:53:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2019-03-04 16:53:52,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-03-04 16:53:52,615 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:52,615 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2019-03-04 16:53:52,615 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:52,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2019-03-04 16:53:52,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:52,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:53:52,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:52,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:52,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:53,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:53,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:53,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:53,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 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-03-04 16:53:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:53:53,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:53:53,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-03-04 16:53:53,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:53,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 59 conjunts are in the unsatisfiable core [2019-03-04 16:53:53,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:53,959 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:54,039 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:54,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:54,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2019-03-04 16:53:54,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:54,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:53:54,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:53:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:54,068 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2019-03-04 16:53:57,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:57,765 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2019-03-04 16:53:57,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-03-04 16:53:57,766 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2019-03-04 16:53:57,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:57,767 INFO L225 Difference]: With dead ends: 214 [2019-03-04 16:53:57,767 INFO L226 Difference]: Without dead ends: 160 [2019-03-04 16:53:57,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2019-03-04 16:53:57,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-03-04 16:53:57,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2019-03-04 16:53:57,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-03-04 16:53:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2019-03-04 16:53:57,785 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2019-03-04 16:53:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:57,786 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2019-03-04 16:53:57,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:53:57,786 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2019-03-04 16:53:57,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-03-04 16:53:57,786 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:57,786 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2019-03-04 16:53:57,786 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:57,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2019-03-04 16:53:57,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:57,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:57,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:57,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:53:58,194 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:58,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:53:58,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:53:58,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:53:58,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:53:58,194 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-03-04 16:53:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:53:58,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:53:58,218 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:53:58,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:53:58,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 32 conjunts are in the unsatisfiable core [2019-03-04 16:53:58,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:53:58,613 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:53:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:53:58,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:53:58,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2019-03-04 16:53:58,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:53:58,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-03-04 16:53:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-03-04 16:53:58,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2019-03-04 16:53:58,906 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2019-03-04 16:53:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:53:59,800 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2019-03-04 16:53:59,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-03-04 16:53:59,800 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2019-03-04 16:53:59,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:53:59,801 INFO L225 Difference]: With dead ends: 225 [2019-03-04 16:53:59,801 INFO L226 Difference]: Without dead ends: 110 [2019-03-04 16:53:59,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2019-03-04 16:53:59,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-03-04 16:53:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-03-04 16:53:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-03-04 16:53:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2019-03-04 16:53:59,821 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2019-03-04 16:53:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:53:59,821 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2019-03-04 16:53:59,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-03-04 16:53:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2019-03-04 16:53:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-03-04 16:53:59,822 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:53:59,822 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2019-03-04 16:53:59,822 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:53:59,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:53:59,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2019-03-04 16:53:59,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:53:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:59,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:53:59,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:53:59,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:53:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:00,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:00,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:00,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:00,590 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-03-04 16:54:00,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:00,600 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:00,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 63 conjunts are in the unsatisfiable core [2019-03-04 16:54:00,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:01,288 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:01,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:01,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:01,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2019-03-04 16:54:01,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:01,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:54:01,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:54:01,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:54:01,387 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2019-03-04 16:54:04,675 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-03-04 16:54:06,059 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-03-04 16:54:06,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:06,372 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2019-03-04 16:54:06,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-03-04 16:54:06,372 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2019-03-04 16:54:06,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:06,374 INFO L225 Difference]: With dead ends: 229 [2019-03-04 16:54:06,374 INFO L226 Difference]: Without dead ends: 171 [2019-03-04 16:54:06,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:54:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-03-04 16:54:06,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2019-03-04 16:54:06,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-03-04 16:54:06,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2019-03-04 16:54:06,399 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2019-03-04 16:54:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:06,399 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2019-03-04 16:54:06,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:54:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2019-03-04 16:54:06,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-03-04 16:54:06,400 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:06,400 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2019-03-04 16:54:06,400 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:06,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:06,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2019-03-04 16:54:06,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:06,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:06,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:06,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:06,859 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:06,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:06,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:06,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:06,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:06,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:06,860 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-03-04 16:54:06,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:06,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:06,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-03-04 16:54:06,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:06,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 34 conjunts are in the unsatisfiable core [2019-03-04 16:54:06,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:07,365 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,365 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:07,679 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:07,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:07,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2019-03-04 16:54:07,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:07,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-03-04 16:54:07,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-03-04 16:54:07,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2019-03-04 16:54:07,700 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2019-03-04 16:54:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:08,241 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2019-03-04 16:54:08,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-03-04 16:54:08,241 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2019-03-04 16:54:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:08,242 INFO L225 Difference]: With dead ends: 240 [2019-03-04 16:54:08,242 INFO L226 Difference]: Without dead ends: 117 [2019-03-04 16:54:08,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2019-03-04 16:54:08,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-03-04 16:54:08,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-03-04 16:54:08,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-03-04 16:54:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2019-03-04 16:54:08,261 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2019-03-04 16:54:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:08,261 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2019-03-04 16:54:08,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-03-04 16:54:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2019-03-04 16:54:08,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-03-04 16:54:08,262 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:08,262 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2019-03-04 16:54:08,262 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:08,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:08,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2019-03-04 16:54:08,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:08,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:08,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:08,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:08,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:09,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:09,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:09,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:09,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:09,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:09,239 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-03-04 16:54:09,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:09,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:09,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:09,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:09,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 67 conjunts are in the unsatisfiable core [2019-03-04 16:54:09,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:10,499 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,499 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:10,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:10,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2019-03-04 16:54:10,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:10,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-03-04 16:54:10,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-03-04 16:54:10,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:54:10,601 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2019-03-04 16:54:15,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:15,804 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2019-03-04 16:54:15,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-03-04 16:54:15,811 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2019-03-04 16:54:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:15,812 INFO L225 Difference]: With dead ends: 244 [2019-03-04 16:54:15,812 INFO L226 Difference]: Without dead ends: 182 [2019-03-04 16:54:15,813 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-03-04 16:54:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-03-04 16:54:15,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2019-03-04 16:54:15,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-03-04 16:54:15,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2019-03-04 16:54:15,837 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2019-03-04 16:54:15,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:15,837 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2019-03-04 16:54:15,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-03-04 16:54:15,837 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2019-03-04 16:54:15,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-03-04 16:54:15,838 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:15,838 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2019-03-04 16:54:15,838 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:15,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2019-03-04 16:54:15,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:15,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:15,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:16,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:16,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:16,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:16,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:16,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:16,807 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-03-04 16:54:16,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:16,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:16,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 36 conjunts are in the unsatisfiable core [2019-03-04 16:54:16,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:17,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:17,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2019-03-04 16:54:17,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:17,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-03-04 16:54:17,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-03-04 16:54:17,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2019-03-04 16:54:17,772 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2019-03-04 16:54:18,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:18,693 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2019-03-04 16:54:18,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-03-04 16:54:18,693 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2019-03-04 16:54:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:18,694 INFO L225 Difference]: With dead ends: 255 [2019-03-04 16:54:18,694 INFO L226 Difference]: Without dead ends: 124 [2019-03-04 16:54:18,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2019-03-04 16:54:18,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-03-04 16:54:18,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2019-03-04 16:54:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-03-04 16:54:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2019-03-04 16:54:18,712 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2019-03-04 16:54:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:18,712 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2019-03-04 16:54:18,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-03-04 16:54:18,712 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2019-03-04 16:54:18,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-03-04 16:54:18,713 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:18,713 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2019-03-04 16:54:18,713 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:18,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:18,713 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2019-03-04 16:54:18,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:18,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:18,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:18,714 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:19,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:19,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:19,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:19,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:19,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:19,636 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-03-04 16:54:19,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:19,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:19,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-03-04 16:54:19,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:19,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:54:19,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:21,902 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:21,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:23,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:23,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2019-03-04 16:54:23,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:23,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-03-04 16:54:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-03-04 16:54:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2019-03-04 16:54:23,663 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2019-03-04 16:54:34,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:34,023 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2019-03-04 16:54:34,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2019-03-04 16:54:34,024 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2019-03-04 16:54:34,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:34,025 INFO L225 Difference]: With dead ends: 325 [2019-03-04 16:54:34,025 INFO L226 Difference]: Without dead ends: 190 [2019-03-04 16:54:34,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2019-03-04 16:54:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-03-04 16:54:34,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2019-03-04 16:54:34,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-03-04 16:54:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2019-03-04 16:54:34,046 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2019-03-04 16:54:34,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:34,046 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2019-03-04 16:54:34,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-03-04 16:54:34,046 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2019-03-04 16:54:34,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-03-04 16:54:34,047 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:34,047 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2019-03-04 16:54:34,047 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:34,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:34,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2019-03-04 16:54:34,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:34,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:34,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:34,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:34,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:35,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:35,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:35,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:35,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:35,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:35,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:35,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 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-03-04 16:54:35,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:54:35,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:54:35,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:54:35,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:35,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 75 conjunts are in the unsatisfiable core [2019-03-04 16:54:35,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:36,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,332 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:36,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:36,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:36,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2019-03-04 16:54:36,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:36,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:54:36,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:54:36,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:54:36,476 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2019-03-04 16:54:40,606 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-03-04 16:54:40,821 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-03-04 16:54:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:42,052 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2019-03-04 16:54:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-03-04 16:54:42,053 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2019-03-04 16:54:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:42,054 INFO L225 Difference]: With dead ends: 274 [2019-03-04 16:54:42,054 INFO L226 Difference]: Without dead ends: 204 [2019-03-04 16:54:42,055 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-03-04 16:54:42,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-03-04 16:54:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2019-03-04 16:54:42,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-03-04 16:54:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2019-03-04 16:54:42,078 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2019-03-04 16:54:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:42,078 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2019-03-04 16:54:42,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:54:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2019-03-04 16:54:42,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-03-04 16:54:42,078 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:42,079 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2019-03-04 16:54:42,079 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:42,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:42,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2019-03-04 16:54:42,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:42,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:42,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:54:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:42,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:43,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:43,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:43,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:43,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:43,495 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-03-04 16:54:43,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:43,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:54:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:43,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 40 conjunts are in the unsatisfiable core [2019-03-04 16:54:43,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:44,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2019-03-04 16:54:44,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:44,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-03-04 16:54:44,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-03-04 16:54:44,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2019-03-04 16:54:44,588 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2019-03-04 16:54:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:54:45,561 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2019-03-04 16:54:45,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-03-04 16:54:45,562 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2019-03-04 16:54:45,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:54:45,562 INFO L225 Difference]: With dead ends: 285 [2019-03-04 16:54:45,562 INFO L226 Difference]: Without dead ends: 138 [2019-03-04 16:54:45,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2019-03-04 16:54:45,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-03-04 16:54:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2019-03-04 16:54:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-03-04 16:54:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2019-03-04 16:54:45,587 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2019-03-04 16:54:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:54:45,587 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2019-03-04 16:54:45,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-03-04 16:54:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2019-03-04 16:54:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-03-04 16:54:45,588 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:54:45,588 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2019-03-04 16:54:45,588 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:54:45,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:54:45,589 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2019-03-04 16:54:45,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:54:45,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:54:45,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:54:45,590 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:54:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:54:46,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:46,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:54:46,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:54:46,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:54:46,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:54:46,680 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-03-04 16:54:46,689 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:54:46,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:54:46,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-03-04 16:54:46,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:54:46,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 44 conjunts are in the unsatisfiable core [2019-03-04 16:54:46,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:54:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:49,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:54:51,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:54:51,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:54:51,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2019-03-04 16:54:51,636 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:54:51,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-03-04 16:54:51,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-03-04 16:54:51,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2019-03-04 16:54:51,637 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2019-03-04 16:55:02,684 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:55:03,003 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:55:03,613 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-03-04 16:55:05,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:05,651 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2019-03-04 16:55:05,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2019-03-04 16:55:05,652 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2019-03-04 16:55:05,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:05,653 INFO L225 Difference]: With dead ends: 363 [2019-03-04 16:55:05,653 INFO L226 Difference]: Without dead ends: 212 [2019-03-04 16:55:05,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2019-03-04 16:55:05,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-03-04 16:55:05,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2019-03-04 16:55:05,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-03-04 16:55:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2019-03-04 16:55:05,677 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2019-03-04 16:55:05,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:05,677 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2019-03-04 16:55:05,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-03-04 16:55:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2019-03-04 16:55:05,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-03-04 16:55:05,678 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:05,678 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2019-03-04 16:55:05,678 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:05,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2019-03-04 16:55:05,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:05,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:05,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:05,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:07,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:07,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:07,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:07,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:07,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:07,216 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-03-04 16:55:07,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:07,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:07,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:07,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:07,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 83 conjunts are in the unsatisfiable core [2019-03-04 16:55:07,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:08,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:08,400 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:08,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:08,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:08,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2019-03-04 16:55:08,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:08,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-03-04 16:55:08,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-03-04 16:55:08,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:55:08,536 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2019-03-04 16:55:12,909 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:55:13,186 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:55:13,441 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-03-04 16:55:15,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:15,293 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2019-03-04 16:55:15,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-03-04 16:55:15,293 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2019-03-04 16:55:15,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:15,295 INFO L225 Difference]: With dead ends: 304 [2019-03-04 16:55:15,295 INFO L226 Difference]: Without dead ends: 226 [2019-03-04 16:55:15,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2019-03-04 16:55:15,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2019-03-04 16:55:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2019-03-04 16:55:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-03-04 16:55:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2019-03-04 16:55:15,329 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2019-03-04 16:55:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:15,330 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2019-03-04 16:55:15,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-03-04 16:55:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2019-03-04 16:55:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-03-04 16:55:15,331 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:15,331 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2019-03-04 16:55:15,331 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:15,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:15,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2019-03-04 16:55:15,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:15,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:15,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:15,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:16,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:16,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:16,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:16,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:16,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:16,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 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-03-04 16:55:16,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:16,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:16,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 44 conjunts are in the unsatisfiable core [2019-03-04 16:55:16,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:17,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:17,501 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:18,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:18,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:18,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2019-03-04 16:55:18,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:18,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-03-04 16:55:18,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-03-04 16:55:18,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2019-03-04 16:55:18,055 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2019-03-04 16:55:19,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:19,378 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2019-03-04 16:55:19,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-03-04 16:55:19,379 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2019-03-04 16:55:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:19,380 INFO L225 Difference]: With dead ends: 315 [2019-03-04 16:55:19,380 INFO L226 Difference]: Without dead ends: 152 [2019-03-04 16:55:19,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:55:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-03-04 16:55:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-03-04 16:55:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-03-04 16:55:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-03-04 16:55:19,405 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2019-03-04 16:55:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:19,406 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-03-04 16:55:19,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-03-04 16:55:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-03-04 16:55:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-03-04 16:55:19,406 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:19,406 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2019-03-04 16:55:19,407 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:19,407 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2019-03-04 16:55:19,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:19,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:19,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:19,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:20,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:20,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:20,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:20,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:20,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:20,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:20,796 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-03-04 16:55:20,805 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:55:20,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:55:21,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-03-04 16:55:21,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:21,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 48 conjunts are in the unsatisfiable core [2019-03-04 16:55:21,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:24,137 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:27,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:27,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:27,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2019-03-04 16:55:27,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:27,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-03-04 16:55:27,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-03-04 16:55:27,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:55:27,033 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2019-03-04 16:55:38,904 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:55:39,216 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:55:39,536 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2019-03-04 16:55:39,819 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:55:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:42,681 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2019-03-04 16:55:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2019-03-04 16:55:42,682 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2019-03-04 16:55:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:42,684 INFO L225 Difference]: With dead ends: 401 [2019-03-04 16:55:42,684 INFO L226 Difference]: Without dead ends: 234 [2019-03-04 16:55:42,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2019-03-04 16:55:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-03-04 16:55:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2019-03-04 16:55:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-03-04 16:55:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2019-03-04 16:55:42,715 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2019-03-04 16:55:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:42,716 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2019-03-04 16:55:42,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-03-04 16:55:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2019-03-04 16:55:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-03-04 16:55:42,717 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:42,717 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2019-03-04 16:55:42,717 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2019-03-04 16:55:42,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:42,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:42,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:42,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:44,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:44,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:44,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:44,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:44,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:44,184 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-03-04 16:55:44,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:55:44,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:55:44,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:55:44,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:55:44,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 91 conjunts are in the unsatisfiable core [2019-03-04 16:55:44,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:45,794 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:45,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:45,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:45,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2019-03-04 16:55:45,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:45,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-03-04 16:55:45,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-03-04 16:55:45,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:55:45,943 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2019-03-04 16:55:51,579 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:55:51,928 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:55:52,352 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-03-04 16:55:52,548 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:55:52,737 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:55:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:54,697 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2019-03-04 16:55:54,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-03-04 16:55:54,698 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2019-03-04 16:55:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:54,699 INFO L225 Difference]: With dead ends: 334 [2019-03-04 16:55:54,699 INFO L226 Difference]: Without dead ends: 248 [2019-03-04 16:55:54,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2019-03-04 16:55:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-03-04 16:55:54,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2019-03-04 16:55:54,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-03-04 16:55:54,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2019-03-04 16:55:54,740 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2019-03-04 16:55:54,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:54,740 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2019-03-04 16:55:54,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-03-04 16:55:54,740 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2019-03-04 16:55:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-03-04 16:55:54,741 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:54,741 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2019-03-04 16:55:54,742 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2019-03-04 16:55:54,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:54,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:55:54,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:54,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:56,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:56,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:55:56,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:55:56,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:55:56,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:55:56,056 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-03-04 16:55:56,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:56,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:55:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:55:56,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 48 conjunts are in the unsatisfiable core [2019-03-04 16:55:56,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:55:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:56,970 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:55:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:55:57,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:55:57,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2019-03-04 16:55:57,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:55:57,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-03-04 16:55:57,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-03-04 16:55:57,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2019-03-04 16:55:57,975 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2019-03-04 16:55:59,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:55:59,524 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2019-03-04 16:55:59,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-03-04 16:55:59,526 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2019-03-04 16:55:59,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:55:59,527 INFO L225 Difference]: With dead ends: 345 [2019-03-04 16:55:59,528 INFO L226 Difference]: Without dead ends: 166 [2019-03-04 16:55:59,528 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-03-04 16:55:59,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-03-04 16:55:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2019-03-04 16:55:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-03-04 16:55:59,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2019-03-04 16:55:59,555 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2019-03-04 16:55:59,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:55:59,555 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2019-03-04 16:55:59,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-03-04 16:55:59,555 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2019-03-04 16:55:59,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-03-04 16:55:59,556 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:55:59,556 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2019-03-04 16:55:59,556 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:55:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:55:59,556 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2019-03-04 16:55:59,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:55:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:59,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:55:59,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:55:59,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:55:59,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:00,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:00,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:00,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:00,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:00,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:00,938 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-03-04 16:56:00,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:00,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:00,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-03-04 16:56:00,992 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:00,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 95 conjunts are in the unsatisfiable core [2019-03-04 16:56:00,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:02,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:02,557 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:02,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:02,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:02,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2019-03-04 16:56:02,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:02,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:56:02,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:56:02,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:56:02,741 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2019-03-04 16:56:09,677 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:56:10,005 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:56:10,313 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2019-03-04 16:56:10,514 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:56:10,711 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:56:10,905 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:56:13,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:13,156 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2019-03-04 16:56:13,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-03-04 16:56:13,156 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2019-03-04 16:56:13,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:13,158 INFO L225 Difference]: With dead ends: 349 [2019-03-04 16:56:13,158 INFO L226 Difference]: Without dead ends: 259 [2019-03-04 16:56:13,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2019-03-04 16:56:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-03-04 16:56:13,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2019-03-04 16:56:13,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-03-04 16:56:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2019-03-04 16:56:13,186 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2019-03-04 16:56:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:13,186 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2019-03-04 16:56:13,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:56:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2019-03-04 16:56:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-03-04 16:56:13,187 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:13,187 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2019-03-04 16:56:13,187 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2019-03-04 16:56:13,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:13,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:13,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:14,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:14,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:14,321 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:14,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:14,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:14,322 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-03-04 16:56:14,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:14,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:14,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:14,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:14,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 50 conjunts are in the unsatisfiable core [2019-03-04 16:56:14,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:15,375 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:16,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:16,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2019-03-04 16:56:16,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:16,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-03-04 16:56:16,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-03-04 16:56:16,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2019-03-04 16:56:16,081 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2019-03-04 16:56:18,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:18,011 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2019-03-04 16:56:18,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-03-04 16:56:18,011 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2019-03-04 16:56:18,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:18,012 INFO L225 Difference]: With dead ends: 360 [2019-03-04 16:56:18,013 INFO L226 Difference]: Without dead ends: 173 [2019-03-04 16:56:18,014 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-03-04 16:56:18,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-03-04 16:56:18,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-03-04 16:56:18,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-03-04 16:56:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2019-03-04 16:56:18,052 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2019-03-04 16:56:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:18,052 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2019-03-04 16:56:18,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-03-04 16:56:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2019-03-04 16:56:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-03-04 16:56:18,053 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:18,053 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2019-03-04 16:56:18,053 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2019-03-04 16:56:18,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:18,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:18,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:18,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:19,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:19,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:19,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:19,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:19,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:19,677 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-03-04 16:56:19,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:19,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:19,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 99 conjunts are in the unsatisfiable core [2019-03-04 16:56:19,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:21,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:21,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:21,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2019-03-04 16:56:21,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:21,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-03-04 16:56:21,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-03-04 16:56:21,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:56:21,579 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2019-03-04 16:56:29,129 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:56:29,473 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:56:29,814 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2019-03-04 16:56:30,042 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:56:30,255 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:56:30,474 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:56:30,679 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:56:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:32,802 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2019-03-04 16:56:32,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-03-04 16:56:32,807 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2019-03-04 16:56:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:32,808 INFO L225 Difference]: With dead ends: 364 [2019-03-04 16:56:32,808 INFO L226 Difference]: Without dead ends: 270 [2019-03-04 16:56:32,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2019-03-04 16:56:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-03-04 16:56:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2019-03-04 16:56:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-03-04 16:56:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2019-03-04 16:56:32,853 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2019-03-04 16:56:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:32,854 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2019-03-04 16:56:32,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-03-04 16:56:32,854 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2019-03-04 16:56:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-03-04 16:56:32,854 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:32,855 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2019-03-04 16:56:32,855 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2019-03-04 16:56:32,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:32,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:32,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:32,857 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:33,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:33,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:33,911 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:33,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:33,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:33,911 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-03-04 16:56:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:56:33,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:56:34,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-03-04 16:56:34,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:34,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 52 conjunts are in the unsatisfiable core [2019-03-04 16:56:34,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:35,290 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:36,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:36,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:36,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2019-03-04 16:56:36,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:36,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-03-04 16:56:36,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-03-04 16:56:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2019-03-04 16:56:36,049 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2019-03-04 16:56:37,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:37,851 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2019-03-04 16:56:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-03-04 16:56:37,852 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2019-03-04 16:56:37,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:37,853 INFO L225 Difference]: With dead ends: 375 [2019-03-04 16:56:37,853 INFO L226 Difference]: Without dead ends: 180 [2019-03-04 16:56:37,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2019-03-04 16:56:37,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-03-04 16:56:37,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-03-04 16:56:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-03-04 16:56:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-03-04 16:56:37,895 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2019-03-04 16:56:37,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:37,895 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-03-04 16:56:37,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-03-04 16:56:37,895 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-03-04 16:56:37,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-03-04 16:56:37,896 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:37,896 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2019-03-04 16:56:37,896 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:37,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2019-03-04 16:56:37,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:37,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:37,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:37,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:40,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:40,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:40,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:40,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:40,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:40,209 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-03-04 16:56:40,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:56:40,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:56:40,246 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:56:40,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:56:40,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 103 conjunts are in the unsatisfiable core [2019-03-04 16:56:40,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:41,903 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:42,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:42,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2019-03-04 16:56:42,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:42,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:56:42,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:56:42,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:56:42,089 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2019-03-04 16:56:48,595 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:56:49,011 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:56:49,386 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-03-04 16:56:49,645 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:56:49,877 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:56:50,105 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:56:50,318 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:56:50,518 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:56:50,723 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-03-04 16:56:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:52,687 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2019-03-04 16:56:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-03-04 16:56:52,688 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2019-03-04 16:56:52,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:52,690 INFO L225 Difference]: With dead ends: 379 [2019-03-04 16:56:52,690 INFO L226 Difference]: Without dead ends: 281 [2019-03-04 16:56:52,691 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-03-04 16:56:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-03-04 16:56:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2019-03-04 16:56:52,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-03-04 16:56:52,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-03-04 16:56:52,731 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2019-03-04 16:56:52,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:52,731 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-03-04 16:56:52,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:56:52,731 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-03-04 16:56:52,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-03-04 16:56:52,739 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:52,740 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2019-03-04 16:56:52,740 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:52,740 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2019-03-04 16:56:52,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:52,741 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:56:52,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:52,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:53,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:53,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:56:53,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:56:53,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:56:53,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:56:53,928 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-03-04 16:56:53,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:53,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:56:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:56:53,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 54 conjunts are in the unsatisfiable core [2019-03-04 16:56:53,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:56:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:55,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:56:55,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:56:55,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:56:55,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2019-03-04 16:56:55,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:56:55,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-03-04 16:56:55,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-03-04 16:56:55,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2019-03-04 16:56:55,872 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2019-03-04 16:56:57,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:56:57,807 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2019-03-04 16:56:57,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-03-04 16:56:57,807 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2019-03-04 16:56:57,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:56:57,808 INFO L225 Difference]: With dead ends: 390 [2019-03-04 16:56:57,808 INFO L226 Difference]: Without dead ends: 187 [2019-03-04 16:56:57,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2019-03-04 16:56:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-03-04 16:56:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-03-04 16:56:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-03-04 16:56:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2019-03-04 16:56:57,849 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2019-03-04 16:56:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:56:57,850 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2019-03-04 16:56:57,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-03-04 16:56:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2019-03-04 16:56:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-03-04 16:56:57,850 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:56:57,850 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2019-03-04 16:56:57,851 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:56:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:56:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2019-03-04 16:56:57,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:56:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:56:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:56:57,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:56:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:00,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:00,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:00,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:00,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:00,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:00,386 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-03-04 16:57:00,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:57:00,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:57:00,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-03-04 16:57:00,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:00,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:57:00,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:04,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:04,896 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:09,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:09,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2019-03-04 16:57:09,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:09,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-03-04 16:57:09,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-03-04 16:57:09,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2019-03-04 16:57:09,069 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2019-03-04 16:57:26,669 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:57:27,115 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:57:27,582 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-03-04 16:57:27,953 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:57:28,321 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:57:28,688 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:57:29,028 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:57:29,390 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:57:29,754 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:57:30,056 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-03-04 16:57:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:32,943 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2019-03-04 16:57:32,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2019-03-04 16:57:32,943 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2019-03-04 16:57:32,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:32,944 INFO L225 Difference]: With dead ends: 496 [2019-03-04 16:57:32,945 INFO L226 Difference]: Without dead ends: 289 [2019-03-04 16:57:32,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2019-03-04 16:57:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-03-04 16:57:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2019-03-04 16:57:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-03-04 16:57:32,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2019-03-04 16:57:32,984 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2019-03-04 16:57:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:32,984 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2019-03-04 16:57:32,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-03-04 16:57:32,985 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2019-03-04 16:57:32,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-03-04 16:57:32,985 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:32,985 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2019-03-04 16:57:32,985 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:32,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:32,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2019-03-04 16:57:32,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:32,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:32,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:32,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:32,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:35,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:35,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:35,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:35,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:35,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:35,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:35,012 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-03-04 16:57:35,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:57:35,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:57:35,048 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:57:35,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:57:35,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 111 conjunts are in the unsatisfiable core [2019-03-04 16:57:35,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:37,027 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:37,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:37,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2019-03-04 16:57:37,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:37,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:57:37,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:57:37,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:57:37,450 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2019-03-04 16:57:45,923 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:57:46,320 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:57:46,704 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2019-03-04 16:57:46,979 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:57:47,245 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:57:47,499 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:57:47,739 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:57:47,980 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:57:48,214 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:57:48,443 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:57:50,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:50,864 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2019-03-04 16:57:50,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-03-04 16:57:50,864 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2019-03-04 16:57:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:50,865 INFO L225 Difference]: With dead ends: 409 [2019-03-04 16:57:50,865 INFO L226 Difference]: Without dead ends: 303 [2019-03-04 16:57:50,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2019-03-04 16:57:50,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-03-04 16:57:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2019-03-04 16:57:50,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-03-04 16:57:50,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2019-03-04 16:57:50,905 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2019-03-04 16:57:50,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:50,905 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2019-03-04 16:57:50,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:57:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2019-03-04 16:57:50,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-03-04 16:57:50,906 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:50,906 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2019-03-04 16:57:50,906 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:50,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:50,906 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2019-03-04 16:57:50,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:50,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:50,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:57:50,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:50,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:52,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:52,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:57:52,004 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:57:52,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:57:52,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:57:52,004 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-03-04 16:57:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:52,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:57:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:57:52,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 58 conjunts are in the unsatisfiable core [2019-03-04 16:57:52,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:57:55,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:55,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:57:56,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:57:56,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:57:56,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2019-03-04 16:57:56,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:57:56,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-03-04 16:57:56,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-03-04 16:57:56,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2019-03-04 16:57:56,669 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2019-03-04 16:57:58,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:57:58,953 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2019-03-04 16:57:58,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-03-04 16:57:58,953 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2019-03-04 16:57:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:57:58,955 INFO L225 Difference]: With dead ends: 420 [2019-03-04 16:57:58,955 INFO L226 Difference]: Without dead ends: 201 [2019-03-04 16:57:58,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2019-03-04 16:57:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-03-04 16:57:58,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-03-04 16:57:58,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-03-04 16:57:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2019-03-04 16:57:58,997 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2019-03-04 16:57:58,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:57:58,997 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2019-03-04 16:57:58,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-03-04 16:57:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2019-03-04 16:57:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-03-04 16:57:58,998 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:57:58,998 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2019-03-04 16:57:58,999 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:57:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:57:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2019-03-04 16:57:58,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:57:59,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:59,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:57:59,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:57:59,000 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:57:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:01,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:01,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:01,045 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:01,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:01,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:01,045 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-03-04 16:58:01,054 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:01,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:01,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-03-04 16:58:01,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:01,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 115 conjunts are in the unsatisfiable core [2019-03-04 16:58:01,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:03,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:03,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:03,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:03,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2019-03-04 16:58:03,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:03,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-03-04 16:58:03,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-03-04 16:58:03,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:58:03,268 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2019-03-04 16:58:11,651 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:58:12,079 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:58:12,488 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2019-03-04 16:58:12,782 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:58:13,063 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:58:13,339 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:58:13,607 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:58:13,863 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:58:14,113 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:58:14,338 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:58:14,561 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:58:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:16,990 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2019-03-04 16:58:16,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-03-04 16:58:16,991 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2019-03-04 16:58:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:16,992 INFO L225 Difference]: With dead ends: 424 [2019-03-04 16:58:16,992 INFO L226 Difference]: Without dead ends: 314 [2019-03-04 16:58:16,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2019-03-04 16:58:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-03-04 16:58:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2019-03-04 16:58:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-03-04 16:58:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2019-03-04 16:58:17,045 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2019-03-04 16:58:17,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:17,045 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2019-03-04 16:58:17,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-03-04 16:58:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2019-03-04 16:58:17,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-03-04 16:58:17,046 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:17,046 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2019-03-04 16:58:17,046 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:17,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:17,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2019-03-04 16:58:17,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:17,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:17,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:18,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:18,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:18,181 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:18,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:18,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:18,181 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-03-04 16:58:18,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:18,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:18,221 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:18,222 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:18,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 60 conjunts are in the unsatisfiable core [2019-03-04 16:58:18,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:19,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:20,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:20,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:20,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2019-03-04 16:58:20,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:20,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-03-04 16:58:20,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-03-04 16:58:20,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2019-03-04 16:58:20,669 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2019-03-04 16:58:23,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:23,154 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2019-03-04 16:58:23,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-03-04 16:58:23,155 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2019-03-04 16:58:23,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:23,155 INFO L225 Difference]: With dead ends: 435 [2019-03-04 16:58:23,156 INFO L226 Difference]: Without dead ends: 208 [2019-03-04 16:58:23,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2019-03-04 16:58:23,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-03-04 16:58:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-03-04 16:58:23,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-03-04 16:58:23,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-03-04 16:58:23,205 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2019-03-04 16:58:23,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:23,205 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-03-04 16:58:23,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-03-04 16:58:23,205 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-03-04 16:58:23,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-03-04 16:58:23,206 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:23,207 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2019-03-04 16:58:23,207 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:23,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:23,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2019-03-04 16:58:23,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:23,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:23,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:23,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:25,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:25,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:25,176 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:25,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:25,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:25,176 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-03-04 16:58:25,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:25,186 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:58:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:25,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 119 conjunts are in the unsatisfiable core [2019-03-04 16:58:25,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:27,343 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:27,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:27,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:27,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2019-03-04 16:58:27,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:27,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:58:27,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:58:27,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:58:27,578 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2019-03-04 16:58:36,463 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:58:36,911 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:58:37,350 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2019-03-04 16:58:37,658 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:58:37,954 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:58:38,245 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:58:38,525 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:58:38,803 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:58:39,069 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:58:39,321 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:58:39,558 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:58:39,790 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:58:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:42,268 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2019-03-04 16:58:42,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2019-03-04 16:58:42,268 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2019-03-04 16:58:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:42,270 INFO L225 Difference]: With dead ends: 439 [2019-03-04 16:58:42,270 INFO L226 Difference]: Without dead ends: 325 [2019-03-04 16:58:42,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 16:58:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-03-04 16:58:42,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2019-03-04 16:58:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-03-04 16:58:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2019-03-04 16:58:42,321 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2019-03-04 16:58:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:42,322 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2019-03-04 16:58:42,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:58:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2019-03-04 16:58:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-03-04 16:58:42,323 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:42,323 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2019-03-04 16:58:42,323 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:42,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:42,324 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2019-03-04 16:58:42,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:42,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:58:42,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:42,325 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:43,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:43,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:43,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:43,652 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:43,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:43,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:43,652 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-03-04 16:58:43,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:58:43,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:58:43,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-03-04 16:58:43,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:43,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 62 conjunts are in the unsatisfiable core [2019-03-04 16:58:43,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:45,261 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:46,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:46,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2019-03-04 16:58:46,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:46,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-03-04 16:58:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-03-04 16:58:46,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2019-03-04 16:58:46,423 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2019-03-04 16:58:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:58:49,061 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2019-03-04 16:58:49,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-03-04 16:58:49,062 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2019-03-04 16:58:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:58:49,063 INFO L225 Difference]: With dead ends: 450 [2019-03-04 16:58:49,063 INFO L226 Difference]: Without dead ends: 215 [2019-03-04 16:58:49,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2019-03-04 16:58:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-03-04 16:58:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2019-03-04 16:58:49,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-03-04 16:58:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2019-03-04 16:58:49,112 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2019-03-04 16:58:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:58:49,112 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2019-03-04 16:58:49,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-03-04 16:58:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2019-03-04 16:58:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-03-04 16:58:49,114 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:58:49,114 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2019-03-04 16:58:49,114 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:58:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:58:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2019-03-04 16:58:49,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:58:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:49,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:58:49,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:58:49,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:58:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:58:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:51,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:51,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:58:51,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:58:51,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:58:51,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:58:51,318 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-03-04 16:58:51,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 16:58:51,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 16:58:51,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 16:58:51,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:58:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 123 conjunts are in the unsatisfiable core [2019-03-04 16:58:51,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:58:53,612 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:53,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:58:53,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:58:53,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:58:53,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2019-03-04 16:58:53,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:58:53,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-03-04 16:58:53,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-03-04 16:58:53,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:58:53,863 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2019-03-04 16:59:03,986 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:59:04,444 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:59:04,881 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2019-03-04 16:59:05,192 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:59:05,486 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:59:05,800 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:59:06,085 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:59:06,370 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:59:06,665 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:59:06,938 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:59:07,195 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:59:07,437 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 16:59:07,675 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 16:59:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:10,240 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2019-03-04 16:59:10,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-03-04 16:59:10,241 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2019-03-04 16:59:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:10,243 INFO L225 Difference]: With dead ends: 454 [2019-03-04 16:59:10,243 INFO L226 Difference]: Without dead ends: 336 [2019-03-04 16:59:10,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2019-03-04 16:59:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-03-04 16:59:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2019-03-04 16:59:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-03-04 16:59:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2019-03-04 16:59:10,296 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2019-03-04 16:59:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:10,296 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2019-03-04 16:59:10,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-03-04 16:59:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2019-03-04 16:59:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-03-04 16:59:10,297 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:10,297 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2019-03-04 16:59:10,297 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:10,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:10,298 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2019-03-04 16:59:10,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:10,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:10,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 16:59:10,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:10,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:11,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:11,589 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:11,589 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:11,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:11,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:11,589 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-03-04 16:59:11,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:11,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 16:59:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:11,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 64 conjunts are in the unsatisfiable core [2019-03-04 16:59:11,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:13,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:13,222 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:14,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:14,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:14,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2019-03-04 16:59:14,383 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:14,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-03-04 16:59:14,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-03-04 16:59:14,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2019-03-04 16:59:14,384 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2019-03-04 16:59:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 16:59:17,241 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2019-03-04 16:59:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-03-04 16:59:17,241 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2019-03-04 16:59:17,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 16:59:17,242 INFO L225 Difference]: With dead ends: 465 [2019-03-04 16:59:17,243 INFO L226 Difference]: Without dead ends: 222 [2019-03-04 16:59:17,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2019-03-04 16:59:17,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-03-04 16:59:17,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2019-03-04 16:59:17,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-03-04 16:59:17,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2019-03-04 16:59:17,286 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2019-03-04 16:59:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 16:59:17,286 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2019-03-04 16:59:17,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-03-04 16:59:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2019-03-04 16:59:17,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-03-04 16:59:17,287 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 16:59:17,287 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2019-03-04 16:59:17,287 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 16:59:17,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 16:59:17,288 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2019-03-04 16:59:17,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 16:59:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:17,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 16:59:17,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 16:59:17,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 16:59:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 16:59:19,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:19,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:19,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 16:59:19,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 16:59:19,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 16:59:19,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 16:59:19,465 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-03-04 16:59:19,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 16:59:19,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 16:59:19,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-03-04 16:59:19,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 16:59:19,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 68 conjunts are in the unsatisfiable core [2019-03-04 16:59:19,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 16:59:25,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:25,328 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 16:59:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 16:59:30,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 16:59:30,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2019-03-04 16:59:30,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 16:59:30,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-03-04 16:59:30,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-03-04 16:59:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2019-03-04 16:59:30,673 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2019-03-04 16:59:54,284 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:59:54,856 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 16:59:55,467 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2019-03-04 16:59:55,976 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 16:59:56,475 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 16:59:56,954 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 16:59:57,423 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 16:59:57,921 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 16:59:58,365 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 16:59:58,797 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 16:59:59,213 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 16:59:59,604 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 16:59:59,975 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:00:00,335 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:00:01,652 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-03-04 17:00:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:04,246 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2019-03-04 17:00:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2019-03-04 17:00:04,246 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2019-03-04 17:00:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:04,248 INFO L225 Difference]: With dead ends: 591 [2019-03-04 17:00:04,248 INFO L226 Difference]: Without dead ends: 344 [2019-03-04 17:00:04,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 37.6s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2019-03-04 17:00:04,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-03-04 17:00:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2019-03-04 17:00:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-03-04 17:00:04,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2019-03-04 17:00:04,298 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2019-03-04 17:00:04,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:04,299 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2019-03-04 17:00:04,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-03-04 17:00:04,299 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2019-03-04 17:00:04,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-03-04 17:00:04,299 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:04,299 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2019-03-04 17:00:04,300 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:04,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:04,300 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2019-03-04 17:00:04,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:04,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:04,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:04,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:06,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:06,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:06,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:06,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:06,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:06,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:06,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 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-03-04 17:00:06,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:00:06,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:00:06,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:00:06,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:06,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 131 conjunts are in the unsatisfiable core [2019-03-04 17:00:06,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:09,289 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:09,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:09,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:09,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2019-03-04 17:00:09,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:09,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-03-04 17:00:09,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-03-04 17:00:09,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 17:00:09,536 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2019-03-04 17:00:22,166 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 17:00:22,676 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 17:00:23,182 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2019-03-04 17:00:23,531 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:00:23,867 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:00:24,195 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:00:24,525 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:00:24,836 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:00:25,137 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:00:25,445 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:00:25,765 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:00:26,042 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:00:26,303 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:00:26,568 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:00:26,824 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:00:29,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:29,521 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2019-03-04 17:00:29,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-03-04 17:00:29,521 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2019-03-04 17:00:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:29,522 INFO L225 Difference]: With dead ends: 484 [2019-03-04 17:00:29,522 INFO L226 Difference]: Without dead ends: 358 [2019-03-04 17:00:29,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2019-03-04 17:00:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-03-04 17:00:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2019-03-04 17:00:29,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-03-04 17:00:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2019-03-04 17:00:29,576 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2019-03-04 17:00:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:29,576 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2019-03-04 17:00:29,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-03-04 17:00:29,576 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2019-03-04 17:00:29,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-03-04 17:00:29,577 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:29,577 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2019-03-04 17:00:29,578 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:29,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:29,578 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2019-03-04 17:00:29,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:29,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:00:29,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:29,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:31,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:31,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:31,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:31,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:31,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:31,084 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-03-04 17:00:31,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:31,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:00:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:31,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 68 conjunts are in the unsatisfiable core [2019-03-04 17:00:31,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:32,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:32,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:34,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:34,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2019-03-04 17:00:34,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:34,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-03-04 17:00:34,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-03-04 17:00:34,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2019-03-04 17:00:34,396 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2019-03-04 17:00:36,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:00:36,728 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2019-03-04 17:00:36,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-03-04 17:00:36,729 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2019-03-04 17:00:36,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:00:36,730 INFO L225 Difference]: With dead ends: 495 [2019-03-04 17:00:36,730 INFO L226 Difference]: Without dead ends: 236 [2019-03-04 17:00:36,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2019-03-04 17:00:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-03-04 17:00:36,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2019-03-04 17:00:36,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-03-04 17:00:36,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2019-03-04 17:00:36,783 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2019-03-04 17:00:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:00:36,783 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2019-03-04 17:00:36,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-03-04 17:00:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2019-03-04 17:00:36,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-03-04 17:00:36,784 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:00:36,785 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2019-03-04 17:00:36,785 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:00:36,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:00:36,785 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2019-03-04 17:00:36,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:00:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:36,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:00:36,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:00:36,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:00:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:00:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:39,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:39,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:00:39,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:00:39,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:00:39,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:00:39,334 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-03-04 17:00:39,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:00:39,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:00:39,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-03-04 17:00:39,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:00:39,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 72 conjunts are in the unsatisfiable core [2019-03-04 17:00:39,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:00:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:46,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:00:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:00:52,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:00:52,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2019-03-04 17:00:52,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:00:52,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-03-04 17:00:52,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-03-04 17:00:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2019-03-04 17:00:52,131 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2019-03-04 17:01:16,843 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 17:01:17,463 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 17:01:18,095 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2019-03-04 17:01:18,693 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 17:01:19,248 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:01:19,786 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:01:20,314 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:01:20,815 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:01:21,296 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:01:21,775 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:01:22,239 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:01:22,680 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:01:23,101 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:01:23,506 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:01:23,909 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:01:24,281 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:01:25,061 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-03-04 17:01:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:28,160 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2019-03-04 17:01:28,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2019-03-04 17:01:28,161 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2019-03-04 17:01:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:28,163 INFO L225 Difference]: With dead ends: 629 [2019-03-04 17:01:28,163 INFO L226 Difference]: Without dead ends: 366 [2019-03-04 17:01:28,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2019-03-04 17:01:28,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-03-04 17:01:28,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2019-03-04 17:01:28,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-03-04 17:01:28,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2019-03-04 17:01:28,217 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2019-03-04 17:01:28,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:28,217 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2019-03-04 17:01:28,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-03-04 17:01:28,217 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2019-03-04 17:01:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-03-04 17:01:28,218 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:28,218 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2019-03-04 17:01:28,218 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:28,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:28,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2019-03-04 17:01:28,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:28,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:28,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:28,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:30,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:30,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:30,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:30,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:30,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:30,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:30,861 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-03-04 17:01:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:01:30,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:01:30,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:01:30,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:01:30,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 139 conjunts are in the unsatisfiable core [2019-03-04 17:01:30,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:33,657 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:33,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:33,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2019-03-04 17:01:33,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:33,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-03-04 17:01:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-03-04 17:01:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 17:01:33,946 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2019-03-04 17:01:45,730 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 17:01:46,282 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 17:01:46,828 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-03-04 17:01:47,212 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 17:01:47,586 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 17:01:47,944 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:01:48,308 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:01:48,652 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:01:49,003 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:01:49,341 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:01:49,665 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:01:49,977 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:01:50,280 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:01:50,573 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:01:50,858 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:01:51,129 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:01:51,401 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:01:54,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:01:54,263 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2019-03-04 17:01:54,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-03-04 17:01:54,263 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2019-03-04 17:01:54,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:01:54,265 INFO L225 Difference]: With dead ends: 514 [2019-03-04 17:01:54,265 INFO L226 Difference]: Without dead ends: 380 [2019-03-04 17:01:54,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2019-03-04 17:01:54,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-03-04 17:01:54,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2019-03-04 17:01:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-03-04 17:01:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2019-03-04 17:01:54,324 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2019-03-04 17:01:54,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:01:54,324 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2019-03-04 17:01:54,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-03-04 17:01:54,324 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2019-03-04 17:01:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-03-04 17:01:54,325 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:01:54,325 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2019-03-04 17:01:54,325 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:01:54,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:01:54,326 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2019-03-04 17:01:54,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:01:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:54,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:01:54,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:01:54,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:01:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:55,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:55,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:55,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:01:55,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:01:55,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:01:55,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:01:55,938 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-03-04 17:01:55,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:01:55,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:01:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:01:55,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 72 conjunts are in the unsatisfiable core [2019-03-04 17:01:55,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:01:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:57,848 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:01:59,282 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:01:59,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:01:59,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2019-03-04 17:01:59,301 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:01:59,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-03-04 17:01:59,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-03-04 17:01:59,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2019-03-04 17:01:59,302 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2019-03-04 17:02:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:01,947 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2019-03-04 17:02:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-03-04 17:02:01,947 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2019-03-04 17:02:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:01,948 INFO L225 Difference]: With dead ends: 525 [2019-03-04 17:02:01,948 INFO L226 Difference]: Without dead ends: 250 [2019-03-04 17:02:01,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2019-03-04 17:02:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-03-04 17:02:02,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2019-03-04 17:02:02,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-03-04 17:02:02,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2019-03-04 17:02:02,010 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2019-03-04 17:02:02,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:02,010 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2019-03-04 17:02:02,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-03-04 17:02:02,010 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2019-03-04 17:02:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-03-04 17:02:02,011 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:02,011 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2019-03-04 17:02:02,011 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:02,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2019-03-04 17:02:02,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:02,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:02,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:02:02,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:02,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:02:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:04,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:04,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:02:04,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:02:04,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:02:04,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:02:04,849 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-03-04 17:02:04,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:02:04,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:02:04,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-03-04 17:02:04,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:02:04,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 17:02:04,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:02:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:12,102 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:02:18,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:02:18,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:02:18,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2019-03-04 17:02:18,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:02:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-03-04 17:02:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-03-04 17:02:18,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2019-03-04 17:02:18,751 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2019-03-04 17:02:45,696 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 17:02:46,367 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 17:02:47,042 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2019-03-04 17:02:47,673 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 17:02:48,291 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 17:02:48,881 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 17:02:49,453 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:02:50,040 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:02:50,592 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:02:51,131 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:02:51,657 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:02:52,154 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:02:52,635 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:02:53,107 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:02:53,556 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:02:53,989 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:02:54,402 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:02:54,808 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:02:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:02:58,906 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2019-03-04 17:02:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2019-03-04 17:02:58,906 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2019-03-04 17:02:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:02:58,908 INFO L225 Difference]: With dead ends: 667 [2019-03-04 17:02:58,908 INFO L226 Difference]: Without dead ends: 388 [2019-03-04 17:02:58,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 47.5s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2019-03-04 17:02:58,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-03-04 17:02:58,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2019-03-04 17:02:58,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-03-04 17:02:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2019-03-04 17:02:58,974 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2019-03-04 17:02:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:02:58,974 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2019-03-04 17:02:58,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-03-04 17:02:58,974 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2019-03-04 17:02:58,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2019-03-04 17:02:58,975 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:02:58,975 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2019-03-04 17:02:58,976 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:02:58,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:02:58,976 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2019-03-04 17:02:58,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:02:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:58,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:02:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:02:58,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:02:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:01,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:01,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:01,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:01,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:01,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:01,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:01,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-03-04 17:03:01,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:03:01,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:03:01,883 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:03:01,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:01,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 147 conjunts are in the unsatisfiable core [2019-03-04 17:03:01,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:05,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:05,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:05,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2019-03-04 17:03:05,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:05,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-03-04 17:03:05,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-03-04 17:03:05,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 17:03:05,358 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2019-03-04 17:03:19,219 WARN L181 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 17:03:19,819 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 17:03:20,410 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2019-03-04 17:03:20,824 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 17:03:21,225 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 17:03:21,625 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 17:03:22,019 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 17:03:22,402 WARN L181 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:03:22,773 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:03:23,146 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:03:23,510 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:03:23,847 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:03:24,185 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:03:24,516 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:03:24,841 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:03:25,149 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:03:25,443 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:03:25,731 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:03:26,005 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:03:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:29,016 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2019-03-04 17:03:29,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-03-04 17:03:29,016 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2019-03-04 17:03:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:29,018 INFO L225 Difference]: With dead ends: 544 [2019-03-04 17:03:29,018 INFO L226 Difference]: Without dead ends: 402 [2019-03-04 17:03:29,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2019-03-04 17:03:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2019-03-04 17:03:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2019-03-04 17:03:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-03-04 17:03:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2019-03-04 17:03:29,084 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2019-03-04 17:03:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:29,084 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2019-03-04 17:03:29,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-03-04 17:03:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2019-03-04 17:03:29,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-03-04 17:03:29,086 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:29,086 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2019-03-04 17:03:29,086 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2019-03-04 17:03:29,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:29,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:29,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:03:29,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:29,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:30,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:30,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:30,813 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:30,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:30,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:30,813 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-03-04 17:03:30,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:30,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:03:30,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:30,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 76 conjunts are in the unsatisfiable core [2019-03-04 17:03:30,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:32,997 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:34,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:34,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2019-03-04 17:03:34,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:34,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-03-04 17:03:34,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-03-04 17:03:34,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2019-03-04 17:03:34,664 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2019-03-04 17:03:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:03:37,530 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2019-03-04 17:03:37,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-03-04 17:03:37,530 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2019-03-04 17:03:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:03:37,532 INFO L225 Difference]: With dead ends: 555 [2019-03-04 17:03:37,532 INFO L226 Difference]: Without dead ends: 264 [2019-03-04 17:03:37,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2019-03-04 17:03:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-03-04 17:03:37,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-03-04 17:03:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-03-04 17:03:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2019-03-04 17:03:37,597 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2019-03-04 17:03:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:03:37,597 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2019-03-04 17:03:37,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-03-04 17:03:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2019-03-04 17:03:37,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-03-04 17:03:37,598 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:03:37,598 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2019-03-04 17:03:37,598 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:03:37,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:03:37,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2019-03-04 17:03:37,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:03:37,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:37,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:03:37,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:03:37,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:03:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:03:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:40,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:40,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:03:40,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:03:40,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:03:40,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:03:40,634 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-03-04 17:03:40,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:03:40,644 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:03:40,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-03-04 17:03:40,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:03:40,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 80 conjunts are in the unsatisfiable core [2019-03-04 17:03:40,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:03:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:48,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:03:56,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:03:56,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:03:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2019-03-04 17:03:56,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:03:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-03-04 17:03:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-03-04 17:03:56,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2019-03-04 17:03:56,201 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2019-03-04 17:04:26,512 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 17:04:27,265 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 17:04:28,094 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2019-03-04 17:04:28,780 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 17:04:29,453 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 17:04:30,109 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 17:04:30,728 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 17:04:31,347 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 17:04:31,940 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:04:32,494 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:04:33,048 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:04:33,596 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:04:34,129 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:04:34,660 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:04:35,170 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:04:35,664 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:04:36,139 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:04:36,595 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:04:37,035 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:04:37,458 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:04:37,900 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-03-04 17:04:41,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:04:41,755 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2019-03-04 17:04:41,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2019-03-04 17:04:41,755 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2019-03-04 17:04:41,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:04:41,757 INFO L225 Difference]: With dead ends: 705 [2019-03-04 17:04:41,758 INFO L226 Difference]: Without dead ends: 410 [2019-03-04 17:04:41,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 53.2s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2019-03-04 17:04:41,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-03-04 17:04:41,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2019-03-04 17:04:41,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-03-04 17:04:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2019-03-04 17:04:41,834 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2019-03-04 17:04:41,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:04:41,834 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2019-03-04 17:04:41,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-03-04 17:04:41,834 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2019-03-04 17:04:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-03-04 17:04:41,835 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:04:41,835 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2019-03-04 17:04:41,835 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:04:41,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:04:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2019-03-04 17:04:41,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:04:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:41,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:04:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:04:41,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:04:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:04:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:44,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:44,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:04:44,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:04:44,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:04:44,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:04:44,943 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-03-04 17:04:44,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-03-04 17:04:44,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-03-04 17:04:44,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-03-04 17:04:44,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:04:45,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 155 conjunts are in the unsatisfiable core [2019-03-04 17:04:45,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:04:48,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:48,390 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:04:48,672 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:04:48,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:04:48,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2019-03-04 17:04:48,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:04:48,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-03-04 17:04:48,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-03-04 17:04:48,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 17:04:48,692 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2019-03-04 17:05:04,777 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 17:05:05,440 WARN L181 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2019-03-04 17:05:06,044 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2019-03-04 17:05:06,497 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2019-03-04 17:05:06,936 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2019-03-04 17:05:07,379 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2019-03-04 17:05:07,812 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2019-03-04 17:05:08,237 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2019-03-04 17:05:08,650 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2019-03-04 17:05:09,039 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2019-03-04 17:05:09,430 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2019-03-04 17:05:09,808 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2019-03-04 17:05:10,184 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-03-04 17:05:10,543 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-03-04 17:05:10,898 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2019-03-04 17:05:11,245 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-03-04 17:05:11,584 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-03-04 17:05:11,911 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2019-03-04 17:05:12,218 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-03-04 17:05:12,519 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-03-04 17:05:12,803 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-03-04 17:05:15,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:05:15,960 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2019-03-04 17:05:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2019-03-04 17:05:15,961 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2019-03-04 17:05:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:05:15,962 INFO L225 Difference]: With dead ends: 574 [2019-03-04 17:05:15,962 INFO L226 Difference]: Without dead ends: 424 [2019-03-04 17:05:15,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2019-03-04 17:05:15,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-03-04 17:05:16,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-03-04 17:05:16,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-03-04 17:05:16,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2019-03-04 17:05:16,046 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2019-03-04 17:05:16,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:05:16,046 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2019-03-04 17:05:16,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-03-04 17:05:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2019-03-04 17:05:16,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-03-04 17:05:16,047 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:05:16,047 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2019-03-04 17:05:16,047 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:05:16,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:05:16,048 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2019-03-04 17:05:16,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:05:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:16,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-03-04 17:05:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:16,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:05:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:17,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:17,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:05:17,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:05:17,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:05:17,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:17,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:05:17,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:05:17,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-03-04 17:05:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:17,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 80 conjunts are in the unsatisfiable core [2019-03-04 17:05:17,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:05:20,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:20,242 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:05:22,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:22,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:05:22,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2019-03-04 17:05:22,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:05:22,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-03-04 17:05:22,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-03-04 17:05:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2019-03-04 17:05:22,109 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2019-03-04 17:05:25,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-03-04 17:05:25,349 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2019-03-04 17:05:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-03-04 17:05:25,350 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2019-03-04 17:05:25,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-03-04 17:05:25,351 INFO L225 Difference]: With dead ends: 585 [2019-03-04 17:05:25,351 INFO L226 Difference]: Without dead ends: 278 [2019-03-04 17:05:25,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2019-03-04 17:05:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-03-04 17:05:25,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2019-03-04 17:05:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-03-04 17:05:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2019-03-04 17:05:25,430 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2019-03-04 17:05:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-03-04 17:05:25,430 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2019-03-04 17:05:25,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-03-04 17:05:25,430 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2019-03-04 17:05:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-03-04 17:05:25,431 INFO L394 BasicCegarLoop]: Found error trace [2019-03-04 17:05:25,431 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2019-03-04 17:05:25,431 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-03-04 17:05:25,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-03-04 17:05:25,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2019-03-04 17:05:25,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-03-04 17:05:25,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:25,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-03-04 17:05:25,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-03-04 17:05:25,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-03-04 17:05:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-03-04 17:05:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:28,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:28,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-03-04 17:05:28,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-03-04 17:05:28,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-03-04 17:05:28,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-03-04 17:05:28,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-03-04 17:05:28,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-03-04 17:05:28,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-03-04 17:05:28,806 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-03-04 17:05:28,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-03-04 17:05:28,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 84 conjunts are in the unsatisfiable core [2019-03-04 17:05:28,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-03-04 17:05:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:37,487 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-03-04 17:05:45,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2850 proven. 2338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-03-04 17:05:45,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-03-04 17:05:45,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 82, 82] total 203 [2019-03-04 17:05:45,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-03-04 17:05:45,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-03-04 17:05:45,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-03-04 17:05:45,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4394, Invalid=37018, Unknown=0, NotChecked=0, Total=41412 [2019-03-04 17:05:45,565 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 163 states.