java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:57:21,779 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:57:21,781 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:57:21,793 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:57:21,793 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:57:21,794 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:57:21,796 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:57:21,797 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:57:21,799 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:57:21,800 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:57:21,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:57:21,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:57:21,802 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:57:21,803 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:57:21,806 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:57:21,807 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:57:21,808 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:57:21,818 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:57:21,822 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:57:21,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:57:21,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:57:21,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:57:21,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:57:21,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:57:21,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:57:21,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:57:21,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:57:21,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:57:21,842 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:57:21,843 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:57:21,844 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:57:21,844 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:57:21,845 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:57:21,846 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:57:21,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:57:21,848 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:57:21,848 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:57:21,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:57:21,874 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:57:21,875 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:57:21,875 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:57:21,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:57:21,875 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:57:21,876 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:57:21,876 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:57:21,876 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:57:21,876 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:57:21,876 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:57:21,877 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:57:21,877 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:57:21,877 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:57:21,878 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:57:21,878 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:57:21,878 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:57:21,880 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:57:21,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:57:21,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:57:21,881 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:57:21,881 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:57:21,881 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:57:21,881 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:57:21,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:57:21,882 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:57:21,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:57:21,883 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:57:21,883 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:57:21,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:57:21,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:57:21,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:57:21,884 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:57:21,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:57:21,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:57:21,884 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:57:21,885 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:57:21,885 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:57:21,885 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:57:21,885 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:57:21,885 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:57:21,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:57:21,932 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:57:21,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:57:21,938 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:57:21,938 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:57:21,939 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl [2018-12-03 16:57:21,939 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl' [2018-12-03 16:57:21,978 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:57:21,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:57:21,983 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:57:21,983 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:57:21,983 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:57:22,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,017 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:57:22,017 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:57:22,017 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:57:22,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:57:22,021 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:57:22,021 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:57:22,021 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:57:22,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,034 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,042 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... [2018-12-03 16:57:22,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:57:22,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:57:22,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:57:22,044 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:57:22,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:57:22,119 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:57:22,120 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:57:22,120 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:57:22,298 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:57:22,298 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:57:22,299 INFO L202 PluginConnector]: Adding new model NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:57:22 BoogieIcfgContainer [2018-12-03 16:57:22,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:57:22,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:57:22,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:57:22,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:57:22,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:57:21" (1/2) ... [2018-12-03 16:57:22,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af8e988 and model type NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:57:22, skipping insertion in model container [2018-12-03 16:57:22,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:57:22" (2/2) ... [2018-12-03 16:57:22,307 INFO L112 eAbstractionObserver]: Analyzing ICFG NeonAngel01.bpl [2018-12-03 16:57:22,319 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:57:22,327 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:57:22,348 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:57:22,379 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:57:22,379 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:57:22,379 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:57:22,380 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:57:22,380 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:57:22,380 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:57:22,380 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:57:22,381 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:57:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:57:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:57:22,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:22,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:57:22,406 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:22,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:22,413 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 16:57:22,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:22,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:22,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:22,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:57:22,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:57:22,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:57:22,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:57:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:57:22,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:57:22,586 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:57:22,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:22,618 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 16:57:22,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:57:22,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:57:22,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:22,632 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:57:22,632 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:57:22,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:57:22,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:57:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:57:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:57:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:57:22,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:57:22,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:22,672 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:57:22,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:57:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:57:22,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:57:22,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:22,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:57:22,674 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:22,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:22,674 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 16:57:22,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:22,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:22,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:22,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:22,810 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 16:57:22,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:22,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:22,812 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:57:22,815 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 16:57:22,859 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:57:22,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:57:22,992 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:57:22,994 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 16:57:23,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:57:23,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:23,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:23,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:23,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:23,087 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 16:57:23,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:23,168 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 16:57:23,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:23,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:57:23,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:23,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:57:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:57:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:57:23,189 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:57:23,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:23,217 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:57:23,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:57:23,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:57:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:23,218 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:57:23,218 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:57:23,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:57:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:57:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:57:23,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:57:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:57:23,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:57:23,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:23,223 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:57:23,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:57:23,223 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:57:23,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:57:23,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:23,224 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:57:23,224 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:23,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,225 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 16:57:23,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:23,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:23,311 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 16:57:23,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,311 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:23,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:23,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:23,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:23,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:23,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:23,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:57:23,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:23,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:23,344 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 16:57:23,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:23,474 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 16:57:23,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:23,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:57:23,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:23,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:57:23,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:57:23,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:57:23,499 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 16:57:23,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:23,554 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:57:23,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:57:23,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:57:23,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:23,557 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:57:23,557 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:57:23,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:57:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:57:23,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:57:23,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:57:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:57:23,564 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:57:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:23,564 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:57:23,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:57:23,565 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:57:23,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:57:23,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:23,565 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:57:23,566 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:23,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,566 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 16:57:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:23,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:23,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:23,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:23,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:23,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:23,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:23,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:23,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:23,806 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:23,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:57:24,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:57:24,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:57:24,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:57:24,044 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 16:57:24,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:24,107 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:57:24,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:57:24,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:57:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:24,108 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:57:24,109 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:57:24,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:57:24,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:57:24,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:57:24,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:57:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:57:24,117 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:57:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:24,117 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:57:24,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:57:24,118 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:57:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:57:24,118 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:24,119 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:57:24,119 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:24,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 16:57:24,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:24,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:24,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,122 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,260 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 16:57:24,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:24,262 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:24,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:24,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:24,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:24,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:24,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:24,307 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 16:57:24,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,461 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 16:57:24,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:57:24,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:57:24,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:57:24,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:57:24,485 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:57:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:24,502 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:57:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:57:24,502 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:57:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:24,503 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:57:24,503 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:57:24,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:57:24,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:57:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:57:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:57:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:57:24,507 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:57:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:24,508 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:57:24,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:57:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:57:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:57:24,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:24,509 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:57:24,509 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:24,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:24,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 16:57:24,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:24,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:24,599 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 16:57:24,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:24,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:24,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:24,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:24,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:24,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:24,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:24,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:57:24,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:24,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:24,629 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 16:57:24,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:25,091 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 16:57:25,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:25,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:57:25,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:25,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:57:25,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:57:25,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:57:25,113 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 16:57:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:25,138 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:57:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:57:25,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:57:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:25,139 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:57:25,140 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:57:25,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:57:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:57:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:57:25,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:57:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:57:25,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:57:25,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:25,145 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:57:25,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:57:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:57:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:57:25,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:25,146 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:57:25,146 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:25,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 16:57:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:25,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,314 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 16:57:25,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:25,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:25,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:25,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:25,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:25,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:25,333 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:25,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:25,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,342 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 16:57:25,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:25,487 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 16:57:25,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:25,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:57:25,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:25,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:57:25,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:57:25,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:57:25,510 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 16:57:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:25,535 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:57:25,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:57:25,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:57:25,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:25,537 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:57:25,537 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:57:25,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:57:25,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:57:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:57:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:57:25,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:57:25,543 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:57:25,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:25,544 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:57:25,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:57:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:57:25,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:57:25,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:25,545 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:57:25,545 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:25,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 16:57:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:25,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:25,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,703 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 16:57:25,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:25,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:25,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:25,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:25,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:25,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,737 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 16:57:25,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:26,043 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 16:57:26,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:26,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:57:26,065 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:26,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:57:26,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:57:26,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:57:26,066 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 16:57:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:26,103 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:57:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:57:26,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:57:26,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:26,105 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:57:26,105 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:57:26,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:57:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:57:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:57:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:57:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:57:26,109 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:57:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:26,109 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:57:26,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:57:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:57:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:57:26,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:26,110 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:57:26,110 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:26,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 16:57:26,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:26,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:26,324 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 16:57:26,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:26,326 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:26,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:26,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,326 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:26,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:26,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:26,350 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:57:26,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:26,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:26,362 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 16:57:26,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:26,595 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 16:57:26,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:26,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:57:26,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:26,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:57:26,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:57:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:26,619 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 16:57:26,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:26,656 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:57:26,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:57:26,656 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:57:26,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:26,656 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:57:26,657 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:57:26,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:57:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:57:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:57:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:57:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:57:26,660 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:57:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:26,660 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:57:26,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:57:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:57:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:57:26,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:26,661 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:57:26,661 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:26,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:26,661 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 16:57:26,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:26,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:26,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:26,663 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:26,835 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 16:57:26,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:26,836 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:26,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:26,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:26,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:26,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:26,846 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:26,859 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:26,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:26,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:26,868 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 16:57:26,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:27,105 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 16:57:27,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:27,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:57:27,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:27,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:57:27,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:57:27,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:57:27,127 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 16:57:27,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:27,166 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:57:27,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:57:27,166 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:57:27,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:27,167 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:57:27,168 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:57:27,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:57:27,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:57:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:57:27,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:57:27,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:57:27,172 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:57:27,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:27,172 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:57:27,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:57:27,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:57:27,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:57:27,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:27,173 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:57:27,173 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:27,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:27,174 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 16:57:27,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:27,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:27,298 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 16:57:27,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:27,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:27,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:27,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:27,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:27,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:27,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:27,328 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 16:57:27,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:27,597 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 16:57:27,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:27,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:57:27,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:27,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:57:27,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:57:27,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:57:27,618 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 16:57:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:27,643 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:57:27,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:57:27,644 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 16:57:27,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:27,645 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:57:27,645 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:57:27,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:57:27,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:57:27,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:57:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:57:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:57:27,649 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:57:27,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:27,649 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:57:27,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:57:27,649 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:57:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:57:27,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:27,650 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:57:27,650 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:27,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:27,651 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 16:57:27,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:27,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:27,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:27,923 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 16:57:27,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:27,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:27,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:27,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:27,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:27,958 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:27,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:28,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:57:28,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:28,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:28,046 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 16:57:28,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:28,447 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 16:57:28,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:28,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:57:28,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:28,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:57:28,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:57:28,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:57:28,468 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 16:57:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:28,505 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:57:28,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:57:28,505 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 16:57:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:28,505 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:57:28,506 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:57:28,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:57:28,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:57:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:57:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:57:28,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:57:28,510 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:57:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:28,510 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:57:28,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:57:28,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:57:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:57:28,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:28,511 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:57:28,511 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:28,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:28,511 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 16:57:28,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:28,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:28,693 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 16:57:28,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:28,693 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:28,693 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:28,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:28,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:28,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:28,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:28,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:28,720 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:28,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:28,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:28,728 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 16:57:28,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:29,272 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 16:57:29,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:29,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:57:29,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:29,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:57:29,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:57:29,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:57:29,293 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 16:57:29,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:29,470 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:57:29,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:57:29,470 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:57:29,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:29,471 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:57:29,471 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:57:29,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:57:29,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:57:29,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:57:29,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:57:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:57:29,532 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:57:29,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:29,533 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:57:29,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:57:29,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:57:29,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:57:29,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:29,533 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:57:29,535 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:29,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:29,535 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 16:57:29,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:29,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:29,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:29,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:29,767 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 16:57:29,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,767 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:29,767 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:29,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:29,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:29,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:29,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:29,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:29,795 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 16:57:29,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:30,172 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 16:57:30,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:30,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:57:30,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:30,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:57:30,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:57:30,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:57:30,193 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 16:57:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:30,220 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:57:30,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:57:30,221 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 16:57:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:30,222 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:57:30,222 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:57:30,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:57:30,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:57:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:57:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:57:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:57:30,227 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:57:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:30,227 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:57:30,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:57:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:57:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:57:30,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:30,228 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:57:30,229 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:30,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 16:57:30,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:30,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:30,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:30,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:30,454 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 16:57:30,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:30,454 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:30,454 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:30,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:30,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:30,455 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:30,463 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:30,464 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:30,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:57:30,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:30,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:30,498 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 16:57:30,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:31,160 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 16:57:31,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:31,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:57:31,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:31,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:57:31,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:57:31,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:57:31,183 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 16:57:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:31,214 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:57:31,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:57:31,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 16:57:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:31,215 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:57:31,216 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:57:31,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:57:31,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:57:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:57:31,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:57:31,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:57:31,220 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:57:31,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:31,221 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:57:31,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:57:31,221 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:57:31,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:57:31,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:31,222 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:57:31,222 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:31,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:31,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 16:57:31,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:31,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:31,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:31,448 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 16:57:31,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:31,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:31,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:31,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:31,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:31,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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:31,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:31,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:31,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:31,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:31,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:31,479 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 16:57:31,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:31,830 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 16:57:31,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:31,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:57:31,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:31,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:57:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:57:31,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:57:31,851 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 16:57:31,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:31,879 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:57:31,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:57:31,880 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:57:31,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:31,880 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:57:31,881 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:57:31,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:57:31,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:57:31,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:57:31,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:57:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:57:31,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:57:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:31,886 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:57:31,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:57:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:57:31,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:57:31,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:31,887 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:57:31,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:31,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:31,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 16:57:31,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:31,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:31,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:32,517 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 16:57:32,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:32,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:32,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:32,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:32,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:32,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:32,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:32,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:32,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:32,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:32,559 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 16:57:32,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:33,246 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 16:57:33,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:33,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:57:33,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:33,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:57:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:57:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:57:33,266 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 16:57:33,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:33,309 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:57:33,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:57:33,310 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 16:57:33,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:33,310 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:57:33,310 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:57:33,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:57:33,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:57:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:57:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:57:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:57:33,315 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 16:57:33,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:33,315 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:57:33,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:57:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:57:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:57:33,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:33,316 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 16:57:33,316 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:33,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 16:57:33,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:33,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:33,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:33,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:34,040 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 16:57:34,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:34,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:34,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:34,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:34,057 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:34,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:34,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:57:34,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:34,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:34,892 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 16:57:34,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:35,889 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 16:57:35,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:35,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:57:35,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:35,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:57:35,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:57:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:57:35,912 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 16:57:35,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:35,953 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 16:57:35,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:57:35,954 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 16:57:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:35,955 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:57:35,955 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:57:35,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:57:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:57:35,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:57:35,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:57:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:57:35,960 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 16:57:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:35,960 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:57:35,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:57:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:57:35,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:57:35,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:35,962 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 16:57:35,962 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:35,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 16:57:35,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:35,964 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:36,754 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 16:57:36,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:36,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:36,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:36,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:36,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:36,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:36,764 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:36,764 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:36,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:36,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:36,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:36,805 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 16:57:36,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:37,476 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 16:57:37,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:37,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:57:37,495 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:37,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:57:37,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:57:37,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:57:37,496 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 16:57:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:37,612 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:57:37,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:57:37,613 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:57:37,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:37,614 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:57:37,614 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:57:37,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:57:37,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:57:37,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:57:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:57:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:57:37,618 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 16:57:37,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:37,618 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:57:37,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:57:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:57:37,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:57:37,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:37,619 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 16:57:37,619 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:37,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:37,619 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 16:57:37,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:37,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:37,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:37,910 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 16:57:37,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:37,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:37,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:37,911 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:37,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:37,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:37,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:37,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:37,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:37,942 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 16:57:37,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:38,426 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 16:57:38,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:38,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:57:38,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:38,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:57:38,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:57:38,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:57:38,449 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 16:57:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:38,483 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 16:57:38,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:57:38,484 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 16:57:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:38,485 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:57:38,485 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:57:38,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:57:38,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:57:38,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:57:38,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:57:38,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:57:38,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 16:57:38,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:38,489 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:57:38,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:57:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:57:38,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:57:38,490 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:38,490 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 16:57:38,490 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:38,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:38,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 16:57:38,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:38,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:38,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:38,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:38,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:38,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:38,721 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:38,721 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:38,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:38,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,721 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:38,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:38,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:38,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:57:38,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:38,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:38,827 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:39,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:57:39,719 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:39,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:57:39,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:57:39,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:57:39,721 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 16:57:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:39,754 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:57:39,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:57:39,755 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 16:57:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:39,756 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:57:39,756 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:57:39,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:57:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:57:39,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:57:39,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:57:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 16:57:39,761 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 16:57:39,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:39,761 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 16:57:39,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:57:39,761 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 16:57:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:57:39,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:39,762 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 16:57:39,762 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:39,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:39,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 16:57:39,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:39,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:39,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:39,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:39,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:40,039 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 16:57:40,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:40,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:40,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:40,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:40,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:40,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:40,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:40,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:40,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:40,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:40,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:40,074 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 16:57:40,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:40,651 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 16:57:40,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:40,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:57:40,671 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:40,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:57:40,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:57:40,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:57:40,672 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 16:57:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:40,723 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 16:57:40,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:57:40,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 16:57:40,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:40,726 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:57:40,726 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:57:40,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:57:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:57:40,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:57:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:57:40,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:57:40,730 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 16:57:40,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:40,730 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:57:40,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:57:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:57:40,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:57:40,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:40,731 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 16:57:40,731 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:40,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:40,732 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 16:57:40,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:40,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:40,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:40,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:41,027 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 16:57:41,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:41,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:41,028 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:41,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:41,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:41,028 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:41,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:41,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:41,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:41,058 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 16:57:41,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:42,023 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 16:57:42,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:42,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:57:42,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:42,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:57:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:57:42,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:57:42,045 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 16:57:42,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:42,127 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:57:42,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:57:42,128 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 16:57:42,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:42,129 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:57:42,129 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:57:42,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:57:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:57:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:57:42,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:57:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:57:42,134 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 16:57:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:42,135 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:57:42,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:57:42,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:57:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:57:42,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:42,136 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 16:57:42,136 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:42,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:42,136 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 16:57:42,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:42,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:42,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:42,473 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 16:57:42,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:42,473 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:42,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:42,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:42,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:42,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:42,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:42,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:20,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:58:20,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:22,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:22,657 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 16:58:22,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:23,420 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 16:58:23,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:23,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:58:23,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:23,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:58:23,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:58:23,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:58:23,445 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 16:58:23,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:23,484 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 16:58:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:58:23,485 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 16:58:23,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:23,485 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:58:23,486 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:58:23,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:58:23,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:58:23,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:58:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:58:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:58:23,491 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 16:58:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:23,492 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:58:23,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:58:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:58:23,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:58:23,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:23,493 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 16:58:23,493 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:23,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 16:58:23,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:23,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:23,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:23,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:23,893 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 16:58:23,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:23,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:23,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:23,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:23,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:23,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:23,902 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:23,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:23,920 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:23,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:23,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:23,928 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 16:58:23,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:24,632 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 16:58:24,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:24,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:58:24,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:24,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:58:24,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:58:24,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:58:24,653 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 16:58:24,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:24,708 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:58:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:58:24,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 16:58:24,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:24,708 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:58:24,708 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:58:24,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:58:24,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:58:24,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:58:24,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:58:24,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 16:58:24,713 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 16:58:24,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:24,713 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 16:58:24,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:58:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 16:58:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:58:24,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:24,714 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 16:58:24,715 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:24,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:24,715 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 16:58:24,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:24,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:24,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:24,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:26,468 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 16:58:26,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:26,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:26,469 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:26,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:26,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:26,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:26,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:26,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:26,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:26,507 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 16:58:26,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:27,907 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 16:58:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:27,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:58:27,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:27,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:58:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:58:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:58:27,929 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 16:58:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:27,970 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 16:58:27,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:58:27,970 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 16:58:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:27,971 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:58:27,971 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:58:27,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:58:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:58:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:58:27,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:58:27,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:58:27,976 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 16:58:27,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:27,976 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:58:27,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:58:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:58:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:58:27,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:27,977 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 16:58:27,977 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:27,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 16:58:27,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:27,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:27,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:27,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:28,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 16:58:28,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:28,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:28,569 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:28,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:28,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:28,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:28,579 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:28,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:36,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:58:36,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:36,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:36,104 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 16:58:36,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:37,032 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 16:58:37,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:58:37,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:37,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:58:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:58:37,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:58:37,056 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 16:58:37,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:37,207 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:58:37,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:58:37,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 16:58:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:37,208 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:58:37,209 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:58:37,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:58:37,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:58:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:58:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:58:37,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:58:37,214 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 16:58:37,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:37,214 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:58:37,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:58:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:58:37,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:58:37,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:37,215 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 16:58:37,215 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:37,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 16:58:37,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:37,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:37,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:37,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:37,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:38,613 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 16:58:38,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:38,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:38,614 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:38,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:38,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:38,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:38,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:38,624 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:38,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:38,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:38,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:38,651 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 16:58:38,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:39,505 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 16:58:39,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:39,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:58:39,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:39,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:58:39,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:58:39,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:58:39,526 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 16:58:39,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:39,570 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 16:58:39,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:58:39,570 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 16:58:39,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:39,571 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:58:39,571 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:58:39,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:58:39,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:58:39,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:58:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:58:39,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:58:39,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 16:58:39,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:39,576 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:58:39,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:58:39,576 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:58:39,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:58:39,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:39,578 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 16:58:39,578 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:39,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:39,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 16:58:39,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:39,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:39,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:39,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:39,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:39,976 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 16:58:39,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:39,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:39,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:39,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:39,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:39,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:39,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:39,986 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:40,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:40,012 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 16:58:40,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:41,346 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 16:58:41,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:41,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:58:41,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:41,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:58:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:58:41,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:58:41,367 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 16:58:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:41,449 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:58:41,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:58:41,449 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 16:58:41,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:41,450 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:58:41,450 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:58:41,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:58:41,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:58:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:58:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:58:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 16:58:41,455 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 16:58:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:41,455 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 16:58:41,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:58:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 16:58:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:58:41,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:41,456 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 16:58:41,456 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:41,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:41,457 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 16:58:41,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:41,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:41,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:41,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:41,458 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:41,995 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 16:58:41,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:41,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:41,996 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:41,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:41,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:41,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:42,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:42,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:50,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:59:50,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:50,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:50,128 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 16:59:50,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:51,218 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 16:59:51,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:51,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:59:51,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:51,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:59:51,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:59:51,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:59:51,241 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 16:59:51,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:51,281 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 16:59:51,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:59:51,281 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 16:59:51,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:51,282 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:59:51,282 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:59:51,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:59:51,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:59:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:59:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:59:51,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:59:51,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 16:59:51,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:51,287 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:59:51,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:59:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:59:51,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:59:51,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:51,288 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 16:59:51,288 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:51,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:51,289 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 16:59:51,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:51,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:51,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:51,917 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:51,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:51,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:51,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:51,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:51,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:51,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:51,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:51,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:51,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:51,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:51,958 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:53,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:59:53,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:53,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:59:53,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:59:53,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:59:53,308 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 16:59:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:53,369 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:59:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:59:53,370 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 16:59:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:53,371 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:59:53,371 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:59:53,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:59:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:59:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:59:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:59:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:59:53,375 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 16:59:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:53,375 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:59:53,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:59:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:59:53,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:59:53,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:53,376 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 16:59:53,376 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:53,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 16:59:53,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:53,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,861 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:53,862 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:53,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:53,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,862 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:53,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:53,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:53,900 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:55,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:55,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:59:55,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:55,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:59:55,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:59:55,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:59:55,080 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 16:59:55,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:55,141 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 16:59:55,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:59:55,142 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 16:59:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:55,142 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:59:55,142 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:59:55,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:59:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:59:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:59:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:59:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:59:55,145 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 16:59:55,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:55,146 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:59:55,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:59:55,146 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:59:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:59:55,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:55,147 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 16:59:55,147 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:55,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:55,147 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 16:59:55,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:55,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:55,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:55,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:55,148 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:56,131 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:56,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:56,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:56,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:56,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:56,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:56,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:56,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:56,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:02,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:01:02,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:02,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:02,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:03,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:01:03,690 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:03,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:01:03,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:01:03,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:01:03,691 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 17:01:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:03,771 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 17:01:03,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:01:03,771 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 17:01:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:03,772 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:01:03,772 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:01:03,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:01:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:01:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:01:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:01:03,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:01:03,777 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 17:01:03,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:03,777 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:01:03,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:01:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:01:03,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:01:03,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:03,777 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 17:01:03,778 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:03,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:03,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 17:01:03,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:03,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:03,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:04,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:04,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:04,656 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:04,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:04,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:04,656 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:04,666 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:04,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:04,688 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:04,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:04,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:04,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:05,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:05,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:01:05,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:05,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:01:05,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:01:05,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:01:05,986 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 17:01:06,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:06,073 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 17:01:06,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:01:06,073 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 17:01:06,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:06,074 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:01:06,074 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:01:06,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:01:06,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:01:06,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 17:01:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:01:06,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 17:01:06,077 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 17:01:06,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:06,077 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 17:01:06,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:01:06,077 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 17:01:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:01:06,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:06,078 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 17:01:06,078 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:06,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 17:01:06,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:06,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:06,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:06,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:06,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:06,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:06,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:06,629 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:06,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:06,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:06,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:06,638 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:06,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:06,666 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:06,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:07,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:01:07,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:07,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:01:07,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:01:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:01:07,999 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 17:01:08,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:08,071 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 17:01:08,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:01:08,071 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 17:01:08,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:08,072 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:01:08,072 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:01:08,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:01:08,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:01:08,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:01:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:01:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 17:01:08,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 17:01:08,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:08,077 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 17:01:08,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:01:08,077 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 17:01:08,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:01:08,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:08,078 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 17:01:08,078 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:08,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:08,078 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 17:01:08,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:08,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:08,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:08,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:08,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:08,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:08,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:08,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:08,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:08,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:08,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:08,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:08,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:44,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:02:44,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:44,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:44,210 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:44,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:45,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:45,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:02:45,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:45,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:02:45,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:02:45,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:02:45,595 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 17:02:45,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:45,654 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 17:02:45,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:02:45,654 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 17:02:45,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:45,655 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:02:45,655 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:02:45,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:02:45,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:02:45,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:02:45,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:02:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 17:02:45,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 17:02:45,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:45,659 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 17:02:45,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:02:45,659 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 17:02:45,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:02:45,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:45,659 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 17:02:45,660 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:45,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:45,660 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 17:02:45,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:45,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:45,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:45,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:45,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:45,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:46,363 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:46,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:46,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:46,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:46,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:46,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:46,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:46,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:46,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:46,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:46,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:46,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:46,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:48,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:48,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:02:48,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:48,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:02:48,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:02:48,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:02:48,232 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 17:02:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:48,290 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 17:02:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:02:48,291 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 17:02:48,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:48,292 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:02:48,292 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:02:48,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:02:48,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:02:48,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:02:48,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:02:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 17:02:48,295 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 17:02:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:48,295 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 17:02:48,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:02:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 17:02:48,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:02:48,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:48,296 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 17:02:48,296 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:48,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 17:02:48,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:48,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:48,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:48,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:48,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:48,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:48,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:48,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:48,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:48,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:48,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:48,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:48,953 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:48,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:50,622 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:50,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:50,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:02:50,641 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:50,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:02:50,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:02:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:02:50,642 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 17:02:50,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:50,711 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 17:02:50,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:02:50,711 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 17:02:50,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:50,712 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:02:50,712 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:02:50,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:02:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:02:50,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:02:50,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:02:50,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 17:02:50,716 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 17:02:50,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:50,716 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 17:02:50,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:02:50,716 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 17:02:50,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:02:50,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:50,717 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 17:02:50,717 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:50,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:50,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 17:02:50,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:50,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:50,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:50,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:50,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:50,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:51,328 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:51,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:51,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:51,329 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:51,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:51,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:51,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:51,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:51,338 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:17,408 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:04:17,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:17,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:17,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:19,587 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:19,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:19,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:04:19,594 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:19,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:04:19,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:04:19,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:04:19,595 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 17:04:19,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:19,657 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 17:04:19,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:04:19,658 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 17:04:19,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:19,658 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:04:19,659 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:04:19,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:04:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:04:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:04:19,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:04:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 17:04:19,662 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 17:04:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:19,663 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 17:04:19,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:04:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 17:04:19,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:04:19,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:19,663 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 17:04:19,663 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:19,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:19,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 17:04:19,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:19,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:19,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:19,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:20,345 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:20,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:20,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:20,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:20,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:20,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:20,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:20,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:20,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:20,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:20,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:20,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:20,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:22,080 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:22,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:04:22,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:22,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:04:22,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:04:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:04:22,100 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 17:04:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:22,148 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 17:04:22,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:04:22,148 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 17:04:22,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:22,149 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:04:22,149 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:04:22,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:04:22,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:04:22,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:04:22,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:04:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 17:04:22,152 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 17:04:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:22,152 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 17:04:22,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:04:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 17:04:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:04:22,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:22,153 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 17:04:22,153 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:22,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 17:04:22,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:22,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:22,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:22,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:22,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:22,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:22,947 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:22,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:22,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:22,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:22,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:22,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:22,956 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:22,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:22,991 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:22,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:25,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:25,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:04:25,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:25,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:04:25,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:04:25,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:04:25,014 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 17:04:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:25,102 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 17:04:25,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:04:25,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 17:04:25,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:25,103 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:04:25,103 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:04:25,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:04:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:04:25,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:04:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:04:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 17:04:25,106 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 17:04:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:25,107 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 17:04:25,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:04:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 17:04:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:04:25,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:25,107 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 17:04:25,108 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:25,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 17:04:25,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:25,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:25,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:25,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:25,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:25,777 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:25,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:25,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:25,777 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:25,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 17:04:25,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:25,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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:25,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:25,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:28,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:06:28,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:29,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:29,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:30,931 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:30,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:30,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:06:30,937 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:30,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:06:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:06:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:06:30,939 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 17:06:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:31,008 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 17:06:31,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:06:31,008 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 17:06:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:31,009 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:06:31,009 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:06:31,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:06:31,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:06:31,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:06:31,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:06:31,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 17:06:31,013 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 17:06:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:31,013 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 17:06:31,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:06:31,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 17:06:31,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:06:31,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:31,013 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 17:06:31,013 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:31,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:31,014 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 17:06:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:31,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:31,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:31,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:31,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:31,790 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:31,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:31,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:31,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:31,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:31,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:31,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:31,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:31,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:31,828 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:31,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:31,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:31,837 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:31,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:33,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:33,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:06:33,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:33,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:06:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:06:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:06:33,871 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 17:06:33,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:33,922 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 17:06:33,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:06:33,923 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 17:06:33,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:33,923 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:06:33,924 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:06:33,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:06:33,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:06:33,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:06:33,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:06:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 17:06:33,927 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 17:06:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:33,928 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 17:06:33,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:06:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 17:06:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:06:33,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:33,928 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 17:06:33,928 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:33,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 17:06:33,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:33,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:33,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:33,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:35,672 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:35,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:35,673 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:35,673 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:35,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:35,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:35,674 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:35,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:35,684 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:35,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:35,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:35,720 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:35,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:37,705 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:37,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:37,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:06:37,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:37,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:06:37,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:06:37,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:06:37,725 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 17:06:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:37,872 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 17:06:37,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:06:37,873 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 17:06:37,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:37,873 INFO L225 Difference]: With dead ends: 50 [2018-12-03 17:06:37,874 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:06:37,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:06:37,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:06:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:06:37,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:06:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 17:06:37,877 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 17:06:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:37,877 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 17:06:37,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:06:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 17:06:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:06:37,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:37,878 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 17:06:37,878 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:37,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:37,878 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 17:06:37,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:37,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:37,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:37,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:37,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:38,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:38,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:38,649 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:38,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:38,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:38,649 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:38,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:38,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:08:58,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:08:58,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:08:59,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:59,135 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:59,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:01,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:01,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:09:01,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:01,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:09:01,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:09:01,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:09:01,229 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 17:09:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:01,281 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 17:09:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:09:01,281 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 17:09:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:01,282 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:09:01,282 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:09:01,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:09:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:09:01,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:09:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:09:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 17:09:01,286 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 17:09:01,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:01,286 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 17:09:01,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:09:01,286 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 17:09:01,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:09:01,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:01,287 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 17:09:01,287 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:01,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:01,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 17:09:01,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:01,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:01,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:01,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:02,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:02,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:02,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:02,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:02,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:02,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:02,085 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:09:02,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:09:02,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:09:02,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:09:02,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:02,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:02,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:04,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:04,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:09:04,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:04,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:09:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:09:04,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:09:04,267 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 17:09:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:04,685 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 17:09:04,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:09:04,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 17:09:04,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:04,686 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:09:04,686 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:09:04,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:09:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:09:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:09:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:09:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 17:09:04,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 17:09:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:04,690 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 17:09:04,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:09:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 17:09:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:09:04,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:04,691 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 17:09:04,691 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 17:09:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:04,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:09:04,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:04,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:05,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:05,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:05,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:05,770 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:05,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:05,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:05,770 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:05,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:05,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:09:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:05,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:09:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:05,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:09:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:08,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:09:08,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:09:08,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:09:08,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:09:08,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:09:08,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:09:08,071 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 17:09:08,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:09:08,156 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 17:09:08,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:09:08,157 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 17:09:08,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:09:08,157 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:09:08,158 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:09:08,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:09:08,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:09:08,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:09:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:09:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 17:09:08,161 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 17:09:08,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:09:08,161 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 17:09:08,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:09:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 17:09:08,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:09:08,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:09:08,162 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 17:09:08,162 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:09:08,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:09:08,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 17:09:08,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:09:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:08,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:09:08,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:09:08,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:09:08,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:09:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:09:09,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:09,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:09:09,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:09:09,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:09:09,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:09:09,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:09:09,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:09:09,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:10:53,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:10:53,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:53,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:53,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:53,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:56,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:56,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:10:56,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:56,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:10:56,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:10:56,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:10:56,122 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 17:10:56,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:56,198 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 17:10:56,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:10:56,206 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 17:10:56,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:56,206 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:10:56,206 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:10:56,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:10:56,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:10:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:10:56,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:10:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 17:10:56,208 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 17:10:56,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:56,211 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 17:10:56,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:10:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 17:10:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:10:56,212 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:56,212 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 17:10:56,212 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:56,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:56,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 17:10:56,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:56,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:56,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:56,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:10:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:57,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:57,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:10:57,094 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:10:57,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:10:57,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:10:57,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:10:57,102 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:10:57,102 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:10:57,139 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:10:57,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:10:57,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:10:57,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:57,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:10:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:10:59,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:10:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:10:59,566 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:10:59,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:10:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:10:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:10:59,567 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 17:10:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:10:59,715 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 17:10:59,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:10:59,716 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 17:10:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:10:59,717 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:10:59,717 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:10:59,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:10:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:10:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:10:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:10:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 17:10:59,720 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 17:10:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:10:59,721 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 17:10:59,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:10:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 17:10:59,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:10:59,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:10:59,721 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 17:10:59,721 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:10:59,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:10:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 17:10:59,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:10:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:59,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:10:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:10:59,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:10:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:00,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:00,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:00,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:00,694 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:00,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:00,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:00,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:00,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:00,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:11:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:00,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:11:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:00,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:11:03,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:03,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:11:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:11:03,531 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:11:03,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:11:03,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:11:03,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:11:03,532 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 17:11:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:11:03,608 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 17:11:03,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:11:03,608 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 17:11:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:11:03,609 INFO L225 Difference]: With dead ends: 56 [2018-12-03 17:11:03,609 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:11:03,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:11:03,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:11:03,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:11:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:11:03,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 17:11:03,612 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 17:11:03,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:11:03,613 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 17:11:03,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:11:03,613 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 17:11:03,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:11:03,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:11:03,613 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 17:11:03,613 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:11:03,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:11:03,614 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 17:11:03,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:11:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:03,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:11:03,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:11:03,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:11:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:11:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:11:04,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:04,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:11:04,718 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:11:04,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:11:04,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:11:04,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:11:04,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:11:04,729 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)