java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:34:34,711 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:34:34,713 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:34:34,725 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:34:34,726 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:34:34,727 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:34:34,728 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:34:34,730 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:34:34,732 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:34:34,733 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:34:34,734 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:34:34,734 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:34:34,735 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:34:34,736 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:34:34,737 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:34:34,738 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:34:34,739 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:34:34,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:34:34,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:34:34,745 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:34:34,746 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:34:34,748 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:34:34,750 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:34:34,751 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:34:34,751 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:34:34,752 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:34:34,753 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:34:34,754 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:34:34,755 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:34:34,756 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:34:34,756 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:34:34,757 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:34:34,758 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:34:34,758 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:34:34,759 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:34:34,760 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:34:34,760 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:34:34,773 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:34:34,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:34:34,774 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:34:34,774 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:34:34,774 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:34:34,775 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:34:34,775 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:34:34,775 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:34:34,775 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:34:34,775 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:34:34,776 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:34:34,776 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:34:34,776 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:34:34,776 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:34:34,776 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:34:34,777 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:34:34,777 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:34:34,777 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:34:34,778 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:34:34,778 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:34:34,778 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:34:34,778 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:34:34,778 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:34:34,779 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:34:34,779 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:34:34,779 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:34:34,779 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:34:34,779 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:34:34,780 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:34:34,780 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:34:34,780 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:34:34,780 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:34:34,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:34:34,781 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:34:34,781 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:34:34,781 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:34:34,781 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:34:34,782 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:34:34,782 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:34:34,782 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:34:34,782 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:34:34,839 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:34:34,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:34:34,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:34:34,862 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:34:34,863 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:34:34,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl [2018-12-03 15:34:34,864 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/functions1.i_3.bpl' [2018-12-03 15:34:34,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:34:34,923 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:34:34,924 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:34:34,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:34:34,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:34:34,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,963 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:34:34,964 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:34:34,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:34:34,965 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:34:34,978 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,979 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... [2018-12-03 15:34:34,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:34:34,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:34:34,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:34:34,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:34:34,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:34:35,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:34:35,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:34:35,270 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:34:35,270 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:34:35,270 INFO L202 PluginConnector]: Adding new model functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:34:35 BoogieIcfgContainer [2018-12-03 15:34:35,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:34:35,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:34:35,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:34:35,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:34:35,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:34:34" (1/2) ... [2018-12-03 15:34:35,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2a9b90 and model type functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:34:35, skipping insertion in model container [2018-12-03 15:34:35,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "functions1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:34:35" (2/2) ... [2018-12-03 15:34:35,278 INFO L112 eAbstractionObserver]: Analyzing ICFG functions1.i_3.bpl [2018-12-03 15:34:35,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:34:35,297 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:34:35,315 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:34:35,350 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:34:35,351 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:34:35,351 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:34:35,351 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:34:35,351 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:34:35,351 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:34:35,352 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:34:35,352 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:34:35,367 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:34:35,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:34:35,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:35,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:34:35,378 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:35,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:35,385 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:34:35,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:35,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:35,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:35,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:35,744 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2018-12-03 15:34:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:35,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:34:35,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:34:35,749 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:34:35,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:34:35,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:34:35,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:34:35,769 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:34:35,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:35,812 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:34:35,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:34:35,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:34:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:35,825 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:34:35,825 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:34:35,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:34:35,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:34:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:34:35,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:34:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:34:35,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:34:35,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:35,863 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:34:35,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:34:35,863 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:34:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:34:35,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:35,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:34:35,864 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:35,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:34:35,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:35,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:35,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:35,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:35,866 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:36,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:36,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:36,036 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:34:36,038 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:34:36,079 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:34:36,079 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:34:36,344 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:34:36,346 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 3 different actions 5 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:34:36,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:36,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:34:36,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:36,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:36,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:36,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:36,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:36,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:36,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:36,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:36,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 15:34:36,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:36,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:34:36,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:34:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:34:36,635 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 5 states. [2018-12-03 15:34:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:36,671 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:34:36,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:34:36,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 15:34:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:36,672 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:34:36,672 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:34:36,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:34:36,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:34:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:34:36,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:34:36,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:34:36,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:34:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:36,677 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:34:36,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:34:36,677 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:34:36,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:34:36,678 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:36,678 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:34:36,678 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:36,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:36,679 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:34:36,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:36,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:36,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:36,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:36,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:37,014 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:34:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:37,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:37,017 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:37,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:37,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:37,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:37,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:37,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:37,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:34:37,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:37,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:37,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2018-12-03 15:34:37,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:37,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:34:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:34:37,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:34:37,252 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 15:34:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:37,294 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:34:37,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:34:37,295 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 15:34:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:37,296 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:34:37,296 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:34:37,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:34:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:34:37,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:34:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:34:37,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:34:37,300 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:34:37,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:37,300 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:34:37,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:34:37,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:34:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:34:37,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:37,304 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:34:37,304 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:37,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 15:34:37,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:37,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:37,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:37,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:37,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:37,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:37,661 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:37,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:37,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:37,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:37,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:37,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:37,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:37,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:37,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:37,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:37,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:37,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 15:34:37,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:37,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:34:37,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:34:37,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:34:37,854 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 7 states. [2018-12-03 15:34:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:37,930 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:34:37,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:34:37,931 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2018-12-03 15:34:37,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:37,932 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:34:37,932 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:34:37,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:34:37,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:34:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:34:37,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:34:37,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:34:37,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:34:37,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:37,936 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:34:37,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:34:37,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:34:37,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:34:37,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:37,937 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:34:37,937 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:37,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 15:34:37,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:37,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:37,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:37,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:37,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:38,503 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:34:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:38,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:38,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:38,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:38,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:38,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:38,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:38,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:38,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:38,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:38,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:38,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:38,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:38,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 15:34:38,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:38,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:34:38,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:34:38,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:34:38,743 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 15:34:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:38,806 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:34:38,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:34:38,808 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 15:34:38,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:38,808 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:34:38,809 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:34:38,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-03 15:34:38,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:34:38,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:34:38,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:34:38,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:34:38,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:34:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:38,813 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:34:38,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:34:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:34:38,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:34:38,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:38,814 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:34:38,815 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:38,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:38,815 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 15:34:38,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:38,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:38,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:38,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:38,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:39,047 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:39,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:39,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:39,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:39,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:39,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:39,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:39,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:34:39,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:39,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:39,297 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:39,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 15:34:39,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:39,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:34:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:34:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:34:39,320 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 9 states. [2018-12-03 15:34:39,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:39,381 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:34:39,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:34:39,382 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 15:34:39,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:39,383 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:34:39,383 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:34:39,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:34:39,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:34:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:34:39,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:34:39,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:34:39,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:34:39,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:39,388 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:34:39,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:34:39,388 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:34:39,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:34:39,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:39,389 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:34:39,389 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:39,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:39,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 15:34:39,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:39,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:39,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:39,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:39,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:39,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:39,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:39,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:39,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:39,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:39,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:39,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:39,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:39,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:39,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:39,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:40,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 15:34:40,050 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:40,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:34:40,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:34:40,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:34:40,051 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 15:34:40,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:40,116 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:34:40,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:34:40,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 15:34:40,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:40,117 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:34:40,117 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:34:40,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:34:40,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:34:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:34:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:34:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:34:40,121 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:34:40,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:40,122 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:34:40,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:34:40,122 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:34:40,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:34:40,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:40,122 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:34:40,123 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:40,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:40,123 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 15:34:40,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:40,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:40,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:40,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:40,573 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-12-03 15:34:40,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:40,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:40,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:40,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:40,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:40,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:40,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:40,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:40,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:40,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:40,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 15:34:40,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:40,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:34:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:34:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:34:40,861 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 11 states. [2018-12-03 15:34:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:40,952 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:34:40,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:34:40,953 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2018-12-03 15:34:40,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:40,954 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:34:40,954 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:34:40,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2018-12-03 15:34:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:34:40,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:34:40,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:34:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:34:40,958 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:34:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:40,958 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:34:40,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:34:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:34:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:34:40,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:40,959 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:34:40,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 15:34:40,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:40,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:40,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:40,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:40,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:41,176 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:41,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:41,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:41,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:41,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:41,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:41,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:41,194 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:41,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:41,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:34:41,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:41,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:41,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:41,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:41,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:41,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 20 [2018-12-03 15:34:41,672 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:41,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:34:41,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:34:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:34:41,674 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 15:34:41,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:41,785 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:34:41,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:34:41,786 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 15:34:41,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:41,787 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:34:41,787 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:34:41,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2018-12-03 15:34:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:34:41,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:34:41,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:34:41,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:34:41,791 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:34:41,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:41,792 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:34:41,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:34:41,792 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:34:41,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:34:41,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:41,793 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:34:41,793 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:41,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:41,793 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 15:34:41,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:41,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:41,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:41,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:42,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:42,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:42,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:42,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:42,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:42,224 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:42,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:42,233 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:42,253 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:42,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:42,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:42,296 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:42,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:42,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:42,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 15:34:42,632 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:42,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:34:42,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:34:42,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:34:42,634 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 13 states. [2018-12-03 15:34:42,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:42,900 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:34:42,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:34:42,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2018-12-03 15:34:42,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:42,902 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:34:42,902 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:34:42,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:34:42,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:34:42,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:34:42,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:34:42,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:34:42,906 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:34:42,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:42,907 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:34:42,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:34:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:34:42,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:34:42,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:42,907 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:34:42,908 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:42,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:42,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 15:34:42,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:42,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:42,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:42,910 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:43,356 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:43,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:43,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:43,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:43,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:43,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:43,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:43,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:43,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:43,446 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:43,777 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:43,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:43,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 15:34:43,797 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:43,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:34:43,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:34:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:34:43,798 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 15:34:43,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:43,923 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:34:43,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:34:43,930 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 15:34:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:43,931 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:34:43,931 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:34:43,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=190, Invalid=410, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:34:43,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:34:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:34:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:34:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:34:43,935 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:34:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:43,935 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:34:43,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:34:43,936 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:34:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:34:43,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:43,936 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:34:43,937 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:43,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:43,937 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 15:34:43,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:43,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:43,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:43,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:44,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:44,187 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:44,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:44,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:44,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:44,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:44,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:44,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:45,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:34:45,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:45,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:45,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 15:34:45,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:45,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:34:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:34:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:34:45,845 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 15 states. [2018-12-03 15:34:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:46,281 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:34:46,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:34:46,282 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 14 [2018-12-03 15:34:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:46,282 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:34:46,283 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:34:46,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=219, Invalid=483, Unknown=0, NotChecked=0, Total=702 [2018-12-03 15:34:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:34:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:34:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:34:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:34:46,288 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:34:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:46,288 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:34:46,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:34:46,288 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:34:46,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:34:46,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:46,289 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:34:46,289 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:46,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:46,290 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 15:34:46,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:46,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:46,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:46,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:46,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:46,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:46,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:46,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:46,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:46,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:46,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:46,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:46,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:46,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:46,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:46,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:47,024 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:47,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:47,500 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:47,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:47,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 15:34:47,521 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:47,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:34:47,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:34:47,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:34:47,522 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 15:34:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:47,825 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:34:47,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:34:47,826 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 15:34:47,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:47,827 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:34:47,827 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:34:47,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=562, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:34:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:34:47,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:34:47,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:34:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:34:47,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:34:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:47,833 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:34:47,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:34:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:34:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:34:47,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:47,834 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:34:47,835 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:47,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:47,835 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 15:34:47,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:47,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:47,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:47,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:48,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:48,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:48,319 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:48,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:48,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:48,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:48,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:48,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:48,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:48,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:48,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:48,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 15:34:48,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:48,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:34:48,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:34:48,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:34:48,901 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 17 states. [2018-12-03 15:34:49,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:49,094 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:34:49,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:34:49,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 16 [2018-12-03 15:34:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:49,095 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:34:49,095 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:34:49,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=283, Invalid=647, Unknown=0, NotChecked=0, Total=930 [2018-12-03 15:34:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:34:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:34:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:34:49,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:34:49,100 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:34:49,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:49,101 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:34:49,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:34:49,101 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:34:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:34:49,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:49,102 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:34:49,102 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:49,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:49,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 15:34:49,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:49,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:49,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:49,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:49,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:49,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:49,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:49,338 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:49,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:49,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:49,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:49,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:49,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:50,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:34:50,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:50,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:50,364 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:50,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:51,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:51,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 15:34:51,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:51,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:34:51,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:34:51,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:34:51,375 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 15:34:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:51,576 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:34:51,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:34:51,577 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 15:34:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:51,578 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:34:51,578 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:34:51,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 15:34:51,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:34:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:34:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:34:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:34:51,584 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:34:51,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:51,584 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:34:51,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:34:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:34:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:34:51,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:51,585 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:34:51,585 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:51,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 15:34:51,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:51,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:51,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:51,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:52,392 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:52,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:52,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:52,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:52,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:52,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:52,404 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:34:52,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:34:52,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:34:52,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:52,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:52,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:53,334 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:53,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 15:34:53,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:53,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:34:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:34:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:34:53,356 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 19 states. [2018-12-03 15:34:53,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:53,603 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:34:53,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:34:53,604 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 18 [2018-12-03 15:34:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:53,605 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:34:53,605 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:34:53,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=355, Invalid=835, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:34:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:34:53,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:34:53,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:34:53,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:34:53,610 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:34:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:53,611 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:34:53,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:34:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:34:53,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:34:53,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:53,611 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:34:53,612 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:53,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:53,612 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 15:34:53,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:53,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:53,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:53,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:53,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:54,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:54,953 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:54,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:54,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:54,953 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:54,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:54,970 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:54,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:55,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:55,137 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:55,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:55,799 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:55,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:55,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 15:34:55,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:55,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:34:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:34:55,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:34:55,820 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 15:34:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:56,075 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:34:56,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:34:56,077 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 15:34:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:56,078 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:34:56,078 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:34:56,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=394, Invalid=938, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 15:34:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:34:56,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:34:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:34:56,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:34:56,082 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:34:56,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:56,082 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:34:56,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:34:56,083 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:34:56,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:34:56,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:56,083 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:34:56,083 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:56,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:56,084 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 15:34:56,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:56,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:56,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:56,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:56,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:57,247 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:57,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:57,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:57,248 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:57,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:57,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:57,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:34:57,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:57,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:10,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:35:10,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:10,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:11,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:12,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:12,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 15:35:12,834 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:12,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:35:12,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:35:12,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:35:12,835 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 21 states. [2018-12-03 15:35:13,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:13,126 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:35:13,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:35:13,127 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 15:35:13,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:13,128 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:35:13,128 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:35:13,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=435, Invalid=1047, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 15:35:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:35:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:35:13,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:35:13,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:35:13,133 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:35:13,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:13,133 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:35:13,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:35:13,133 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:35:13,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:35:13,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:13,134 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:35:13,134 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:13,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:13,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 15:35:13,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:13,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:13,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:13,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:13,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:13,795 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:13,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:13,796 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:13,796 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:13,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:13,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:13,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:13,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:35:13,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:35:13,850 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:35:13,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:13,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:14,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:15,345 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:15,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:15,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 15:35:15,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:15,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:35:15,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:35:15,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:35:15,366 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 15:35:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:15,625 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:35:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:35:15,626 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 15:35:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:15,627 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:35:15,627 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:35:15,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=478, Invalid=1162, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 15:35:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:35:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:35:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:35:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:35:15,633 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:35:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:15,633 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:35:15,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:35:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:35:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:35:15,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:15,634 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:35:15,635 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:15,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 15:35:15,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:15,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:35:15,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:15,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:16,390 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:16,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:16,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:16,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:16,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:16,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:16,391 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:16,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:16,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:35:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:16,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:16,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:17,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:35:17,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 15:35:17,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:35:17,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:35:17,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:35:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:35:17,476 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 23 states. [2018-12-03 15:35:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:35:17,808 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:35:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:35:17,809 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 22 [2018-12-03 15:35:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:35:17,810 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:35:17,810 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:35:17,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=523, Invalid=1283, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 15:35:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:35:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:35:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:35:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:35:17,815 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:35:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:35:17,815 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:35:17,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:35:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:35:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:35:17,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:35:17,816 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:35:17,816 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:35:17,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:35:17,817 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 15:35:17,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:35:17,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:17,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:35:17,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:35:17,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:35:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:35:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:18,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:18,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:35:18,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:35:18,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:35:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:35:18,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:35:18,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:35:18,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:35:20,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:35:20,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:35:20,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:35:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:35:20,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:35:24,326 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:35:37,276 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:36:04,715 WARN L180 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:36:45,244 WARN L854 $PredicateComparison]: unable to prove that (or (not (= 0 (mod c_ULTIMATE.start_main_~x~5 2))) (< (mod (+ c_ULTIMATE.start_main_~x~5 34) 4294967296) 268435455) (<= 268435455 (mod (+ c_ULTIMATE.start_main_~x~5 32) 4294967296))) is different from true [2018-12-03 15:37:22,742 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 182 refuted. 8 times theorem prover too weak. 0 trivial. 20 not checked. [2018-12-03 15:37:22,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:22,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 44 [2018-12-03 15:37:22,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:22,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:37:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:37:22,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=1304, Unknown=44, NotChecked=84, Total=1980 [2018-12-03 15:37:22,764 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 15:37:23,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:23,118 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:37:23,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:37:23,119 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 15:37:23,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:23,120 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:37:23,120 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:37:23,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 123.3s TimeCoverageRelationStatistics Valid=548, Invalid=1304, Unknown=44, NotChecked=84, Total=1980 [2018-12-03 15:37:23,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:37:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:37:23,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:37:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:37:23,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:37:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:23,129 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:37:23,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:37:23,129 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:37:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:37:23,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:23,130 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:37:23,130 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:23,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 15:37:23,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:23,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:23,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:23,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:24,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:24,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:24,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:24,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:24,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:24,450 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:37:24,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:37:24,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:37:24,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:37:24,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:24,598 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:24,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:25,636 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:25,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:25,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 15:37:25,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:25,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:37:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:37:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:37:25,659 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 25 states. [2018-12-03 15:37:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:26,003 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:37:26,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:37:26,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 24 [2018-12-03 15:37:26,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:26,005 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:37:26,005 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:37:26,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=619, Invalid=1543, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:37:26,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:37:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:37:26,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:37:26,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:37:26,011 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:37:26,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:26,011 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:37:26,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:37:26,011 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:37:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:37:26,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:26,012 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:37:26,012 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:26,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:26,012 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 15:37:26,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:26,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:37:26,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:26,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:27,391 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:27,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:27,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:27,392 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:27,392 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:27,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:27,392 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:27,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:27,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:37:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:27,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:37:27,480 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:27,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:37:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:28,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:37:28,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 15:37:28,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:37:28,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:37:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:37:28,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:37:28,753 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 15:37:29,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:37:29,488 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:37:29,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:37:29,488 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 15:37:29,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:37:29,489 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:37:29,489 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:37:29,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=670, Invalid=1682, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 15:37:29,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:37:29,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:37:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:37:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:37:29,495 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:37:29,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:37:29,495 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:37:29,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:37:29,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:37:29,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:37:29,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:37:29,496 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:37:29,496 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:37:29,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:37:29,496 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 15:37:29,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:37:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:29,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:37:29,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:37:29,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:37:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:37:30,415 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:37:30,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:30,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:37:30,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:37:30,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:37:30,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:37:30,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:37:30,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:37:30,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:38:36,168 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:38:36,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:38:36,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:38:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:38:36,540 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:48,683 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 271 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:48,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:48,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 15:40:48,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:48,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:40:48,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:40:48,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=723, Invalid=1783, Unknown=44, NotChecked=0, Total=2550 [2018-12-03 15:40:48,706 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 27 states. [2018-12-03 15:40:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:49,440 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:40:49,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:40:49,441 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 26 [2018-12-03 15:40:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:49,441 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:40:49,442 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:40:49,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 133.0s TimeCoverageRelationStatistics Valid=723, Invalid=1783, Unknown=44, NotChecked=0, Total=2550 [2018-12-03 15:40:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:40:49,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:40:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:40:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:40:49,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:40:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:49,449 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:40:49,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:40:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:40:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:40:49,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:49,450 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:40:49,450 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:49,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 15:40:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:49,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:49,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:50,004 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:50,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:50,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:50,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:50,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:50,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:50,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:50,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:40:50,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:40:50,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:40:50,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:40:50,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:50,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:52,102 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:52,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:52,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 15:40:52,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:52,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:40:52,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:40:52,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:40:52,123 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 15:40:52,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:52,589 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:40:52,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:40:52,589 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 15:40:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:52,590 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:40:52,590 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:40:52,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=778, Invalid=1978, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:40:52,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:40:52,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:40:52,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:40:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:40:52,596 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:40:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:52,596 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:40:52,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:40:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:40:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:40:52,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:52,597 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:40:52,597 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:52,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:52,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 15:40:52,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:52,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:52,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:40:52,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:52,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:53,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:53,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:53,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:53,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:53,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:53,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:40:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:53,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:40:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:53,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:40:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:55,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:40:55,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 15:40:55,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:40:55,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:40:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:40:55,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:40:55,070 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 29 states. [2018-12-03 15:40:55,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:40:55,566 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:40:55,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:40:55,567 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 28 [2018-12-03 15:40:55,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:40:55,567 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:40:55,568 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:40:55,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=835, Invalid=2135, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 15:40:55,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:40:55,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:40:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:40:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:40:55,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:40:55,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:40:55,574 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:40:55,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:40:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:40:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:40:55,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:40:55,575 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:40:55,575 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:40:55,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:40:55,576 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 15:40:55,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:40:55,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:55,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:40:55,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:40:55,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:40:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:40:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:40:56,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:56,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:40:56,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:40:56,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:40:56,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:40:56,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:40:56,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:40:56,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:42:41,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:42:41,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:42:41,451 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:42:41,569 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:42:41,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:42:44,527 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 16 [2018-12-03 15:42:49,987 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:42:54,844 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:43:01,772 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:46:11,019 WARN L180 SmtUtils]: Spent 988.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-03 15:46:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 330 refuted. 21 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:29,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:29,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 56 [2018-12-03 15:46:29,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:29,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:46:29,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:46:29,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=894, Invalid=2220, Unknown=78, NotChecked=0, Total=3192 [2018-12-03 15:46:29,299 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 15:46:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:29,908 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:46:29,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:46:29,910 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 15:46:29,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:29,910 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:46:29,911 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:46:29,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 228.3s TimeCoverageRelationStatistics Valid=894, Invalid=2220, Unknown=78, NotChecked=0, Total=3192 [2018-12-03 15:46:29,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:46:29,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:46:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:46:29,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:46:29,916 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:46:29,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:29,916 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:46:29,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:46:29,917 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:46:29,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:46:29,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:29,917 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:46:29,917 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:29,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:29,918 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 15:46:29,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:29,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:29,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:29,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:29,919 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:30,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:30,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:30,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:30,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:30,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:30,510 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:30,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:30,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:30,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:30,567 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:30,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:30,638 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:30,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:32,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:32,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 15:46:32,419 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:32,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:46:32,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:46:32,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:46:32,420 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 31 states. [2018-12-03 15:46:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:33,007 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:46:33,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:46:33,008 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 30 [2018-12-03 15:46:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:33,009 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:46:33,009 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:46:33,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=955, Invalid=2467, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:46:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:46:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:46:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:46:33,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:46:33,016 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:46:33,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:33,016 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:46:33,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:46:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:46:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:46:33,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:33,017 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:46:33,017 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:33,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:33,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 15:46:33,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:33,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:33,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:33,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:33,024 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:33,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:33,676 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:33,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:33,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:33,677 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:33,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:33,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:33,677 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:33,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:33,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:33,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:33,784 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:33,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:35,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:35,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 15:46:35,801 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:35,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:46:35,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:46:35,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:46:35,803 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 15:46:36,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:36,371 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:46:36,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:46:36,371 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 15:46:36,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:36,372 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:46:36,372 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:46:36,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1018, Invalid=2642, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 15:46:36,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:46:36,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:46:36,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:46:36,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:46:36,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:46:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:36,377 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:46:36,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:46:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:46:36,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:46:36,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:36,378 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:46:36,378 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:36,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:36,379 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 15:46:36,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:36,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:36,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:36,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:36,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:37,096 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:37,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:37,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:37,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:37,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:37,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:37,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:46:37,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:37,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:56,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:47:56,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:56,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:56,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:13,594 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 17