java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 09:57:21,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 09:57:21,728 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 09:57:21,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 09:57:21,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 09:57:21,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 09:57:21,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 09:57:21,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 09:57:21,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 09:57:21,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 09:57:21,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 09:57:21,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 09:57:21,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 09:57:21,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 09:57:21,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 09:57:21,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 09:57:21,753 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 09:57:21,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 09:57:21,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 09:57:21,767 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 09:57:21,769 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 09:57:21,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 09:57:21,777 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 09:57:21,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 09:57:21,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 09:57:21,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 09:57:21,779 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 09:57:21,782 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 09:57:21,783 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 09:57:21,784 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 09:57:21,785 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 09:57:21,787 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 09:57:21,787 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 09:57:21,789 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 09:57:21,790 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 09:57:21,791 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 09:57:21,792 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 09:57:21,819 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 09:57:21,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 09:57:21,820 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 09:57:21,820 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 09:57:21,821 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 09:57:21,822 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 09:57:21,822 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 09:57:21,822 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 09:57:21,823 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 09:57:21,823 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 09:57:21,823 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 09:57:21,823 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 09:57:21,823 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 09:57:21,824 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 09:57:21,825 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 09:57:21,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 09:57:21,826 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 09:57:21,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 09:57:21,826 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 09:57:21,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 09:57:21,828 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 09:57:21,829 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 09:57:21,829 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 09:57:21,829 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 09:57:21,829 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 09:57:21,830 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 09:57:21,830 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 09:57:21,830 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 09:57:21,830 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 09:57:21,830 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 09:57:21,830 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 09:57:21,831 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 09:57:21,831 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 09:57:21,831 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 09:57:21,831 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 09:57:21,831 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 09:57:21,832 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 09:57:21,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 09:57:21,832 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 09:57:21,832 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 09:57:21,865 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 09:57:21,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 09:57:21,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 09:57:21,891 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 09:57:21,891 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 09:57:21,892 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-01-20 09:57:21,893 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-01-20 09:57:21,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 09:57:21,940 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 09:57:21,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 09:57:21,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 09:57:21,957 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 09:57:21,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 09:57:21,978 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 09:57:21,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/1) ... [2019-01-20 09:57:21,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 09:57:21,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 09:57:21,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 09:57:21,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 09:57:22,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09: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 [2019-01-20 09:57:22,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 09:57:22,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 09:57:22,230 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 09:57:22,230 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-20 09:57:22,232 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22 BoogieIcfgContainer [2019-01-20 09:57:22,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 09:57:22,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 09:57:22,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 09:57:22,235 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 09:57:22,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 09:57:21" (1/2) ... [2019-01-20 09:57:22,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716ebfbe and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 09:57:22, skipping insertion in model container [2019-01-20 09:57:22,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 09:57:22" (2/2) ... [2019-01-20 09:57:22,239 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-01-20 09:57:22,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 09:57:22,255 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 09:57:22,267 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 09:57:22,295 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 09:57:22,296 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 09:57:22,296 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 09:57:22,296 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 09:57:22,296 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 09:57:22,296 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 09:57:22,297 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 09:57:22,297 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 09:57:22,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-20 09:57:22,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 09:57:22,317 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 09:57:22,320 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,327 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-20 09:57:22,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:22,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 09:57:22,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 09:57:22,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 09:57:22,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 09:57:22,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 09:57:22,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 09:57:22,486 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-20 09:57:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:22,536 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-20 09:57:22,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 09:57:22,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 09:57:22,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:22,550 INFO L225 Difference]: With dead ends: 9 [2019-01-20 09:57:22,551 INFO L226 Difference]: Without dead ends: 5 [2019-01-20 09:57:22,554 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 [2019-01-20 09:57:22,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-20 09:57:22,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-20 09:57:22,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-20 09:57:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-20 09:57:22,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-20 09:57:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:22,585 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-20 09:57:22,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 09:57:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-20 09:57:22,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 09:57:22,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:22,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 09:57:22,587 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:22,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,587 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-20 09:57:22,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:22,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:22,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:22,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:22,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:22,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 09:57:22,734 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-20 09:57:22,783 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 09:57:22,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 09:57:22,951 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 09:57:22,954 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 09:57:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:22,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 09:57:22,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:22,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:22,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:22,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:23,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-20 09:57:23,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 09:57:23,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 09:57:23,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 09:57:23,130 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-20 09:57:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,176 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-20 09:57:23,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 09:57:23,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 09:57:23,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,177 INFO L225 Difference]: With dead ends: 8 [2019-01-20 09:57:23,178 INFO L226 Difference]: Without dead ends: 6 [2019-01-20 09:57:23,179 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 [2019-01-20 09:57:23,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-20 09:57:23,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-20 09:57:23,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-20 09:57:23,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-20 09:57:23,181 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-20 09:57:23,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,182 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-20 09:57:23,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 09:57:23,182 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-20 09:57:23,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 09:57:23,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,183 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-20 09:57:23,183 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,183 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-20 09:57:23,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:23,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:23,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:23,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:23,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:23,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 09:57:23,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:23,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-20 09:57:23,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 09:57:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 09:57:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 09:57:23,394 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-20 09:57:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,467 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-20 09:57:23,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 09:57:23,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-20 09:57:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,468 INFO L225 Difference]: With dead ends: 9 [2019-01-20 09:57:23,469 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 09:57:23,469 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 [2019-01-20 09:57:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 09:57:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 09:57:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 09:57:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-20 09:57:23,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-20 09:57:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,473 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-20 09:57:23,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 09:57:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-20 09:57:23,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 09:57:23,474 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,474 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-20 09:57:23,474 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,476 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-20 09:57:23,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:23,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:23,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:23,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:23,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:23,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:23,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:23,694 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:23,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:23,737 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:23,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:23,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:23,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:23,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 09:57:23,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:23,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 09:57:23,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 09:57:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 09:57:23,941 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-20 09:57:23,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:23,956 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-20 09:57:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 09:57:23,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-20 09:57:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:23,958 INFO L225 Difference]: With dead ends: 10 [2019-01-20 09:57:23,958 INFO L226 Difference]: Without dead ends: 8 [2019-01-20 09:57:23,958 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 [2019-01-20 09:57:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-20 09:57:23,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-20 09:57:23,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-20 09:57:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-20 09:57:23,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-20 09:57:23,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:23,961 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-20 09:57:23,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 09:57:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-20 09:57:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 09:57:23,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:23,962 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-20 09:57:23,963 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-20 09:57:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:23,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,137 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,165 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-20 09:57:24,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 09:57:24,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 09:57:24,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 09:57:24,311 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-20 09:57:24,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:24,340 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-20 09:57:24,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 09:57:24,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 09:57:24,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:24,341 INFO L225 Difference]: With dead ends: 11 [2019-01-20 09:57:24,341 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 09:57:24,342 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 [2019-01-20 09:57:24,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 09:57:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 09:57:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 09:57:24,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-20 09:57:24,344 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-20 09:57:24,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:24,345 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-20 09:57:24,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 09:57:24,345 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-20 09:57:24,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 09:57:24,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:24,346 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-20 09:57:24,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:24,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:24,347 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-20 09:57:24,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:24,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:24,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:24,462 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:24,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:24,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:24,463 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:24,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:24,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:24,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 09:57:24,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:24,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:24,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:24,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-20 09:57:24,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:24,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 09:57:24,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 09:57:24,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:24,953 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-20 09:57:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,004 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-20 09:57:25,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 09:57:25,004 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-20 09:57:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,005 INFO L225 Difference]: With dead ends: 12 [2019-01-20 09:57:25,005 INFO L226 Difference]: Without dead ends: 10 [2019-01-20 09:57:25,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 09:57:25,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-20 09:57:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-20 09:57:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-20 09:57:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-20 09:57:25,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-20 09:57:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,009 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-20 09:57:25,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 09:57:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-20 09:57:25,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 09:57:25,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,010 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-20 09:57:25,010 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-20 09:57:25,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:25,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,112 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:25,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:25,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:25,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:25,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-20 09:57:25,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 09:57:25,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 09:57:25,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:25,316 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-20 09:57:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,377 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-20 09:57:25,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 09:57:25,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-20 09:57:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,378 INFO L225 Difference]: With dead ends: 13 [2019-01-20 09:57:25,378 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 09:57:25,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 09:57:25,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 09:57:25,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 09:57:25,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 09:57:25,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-20 09:57:25,382 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-20 09:57:25,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,382 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-20 09:57:25,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 09:57:25,382 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-20 09:57:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 09:57:25,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,383 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-20 09:57:25,383 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,383 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-20 09:57:25,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:25,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,508 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,509 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,509 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:25,518 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,543 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:25,773 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:25,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-20 09:57:25,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:25,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 09:57:25,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 09:57:25,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:25,794 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-20 09:57:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:25,826 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-20 09:57:25,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 09:57:25,829 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-20 09:57:25,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:25,830 INFO L225 Difference]: With dead ends: 14 [2019-01-20 09:57:25,830 INFO L226 Difference]: Without dead ends: 12 [2019-01-20 09:57:25,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 09:57:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-20 09:57:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-20 09:57:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 09:57:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-20 09:57:25,833 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-20 09:57:25,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:25,833 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-20 09:57:25,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 09:57:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-20 09:57:25,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-20 09:57:25,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:25,834 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-20 09:57:25,834 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:25,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:25,835 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-20 09:57:25,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:25,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:25,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:25,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:25,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:25,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:25,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:25,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:25,945 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:25,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:25,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 09:57:25,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:25,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:25,985 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:25,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,167 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:26,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-20 09:57:26,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:26,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 09:57:26,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 09:57:26,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:26,189 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-20 09:57:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,219 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-20 09:57:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 09:57:26,219 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-20 09:57:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,219 INFO L225 Difference]: With dead ends: 15 [2019-01-20 09:57:26,220 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 09:57:26,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 09:57:26,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 09:57:26,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 09:57:26,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 09:57:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-20 09:57:26,224 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-20 09:57:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,224 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-20 09:57:26,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 09:57:26,224 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-20 09:57:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 09:57:26,224 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,225 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-20 09:57:26,225 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-20 09:57:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:26,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:26,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:26,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:26,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:26,472 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:26,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:26,483 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:26,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:26,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:26,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-20 09:57:26,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:26,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 09:57:26,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 09:57:26,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 09:57:26,720 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-20 09:57:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:26,746 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-20 09:57:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 09:57:26,747 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-20 09:57:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:26,748 INFO L225 Difference]: With dead ends: 16 [2019-01-20 09:57:26,748 INFO L226 Difference]: Without dead ends: 14 [2019-01-20 09:57:26,749 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 [2019-01-20 09:57:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-20 09:57:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-20 09:57:26,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-20 09:57:26,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-20 09:57:26,752 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-20 09:57:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:26,752 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-20 09:57:26,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 09:57:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-20 09:57:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-20 09:57:26,753 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:26,753 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-20 09:57:26,754 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:26,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-20 09:57:26,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,755 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:26,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:26,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,884 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:26,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:26,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:26,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:26,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:26,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:26,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:26,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:26,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:27,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-20 09:57:27,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:27,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 09:57:27,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 09:57:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 09:57:27,143 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-20 09:57:27,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:27,176 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-20 09:57:27,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 09:57:27,177 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-20 09:57:27,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:27,178 INFO L225 Difference]: With dead ends: 17 [2019-01-20 09:57:27,178 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 09:57:27,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 09:57:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 09:57:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 09:57:27,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 09:57:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-20 09:57:27,183 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-20 09:57:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:27,183 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-20 09:57:27,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 09:57:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-20 09:57:27,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 09:57:27,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:27,184 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-20 09:57:27,184 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:27,184 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-20 09:57:27,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:27,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:27,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:27,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:27,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:27,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:27,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:27,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:27,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:27,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:27,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 09:57:27,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:27,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:27,827 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:27,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:28,324 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:28,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:28,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-20 09:57:28,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:28,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 09:57:28,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 09:57:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:28,348 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-20 09:57:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:28,382 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-20 09:57:28,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 09:57:28,388 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-20 09:57:28,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:28,389 INFO L225 Difference]: With dead ends: 18 [2019-01-20 09:57:28,389 INFO L226 Difference]: Without dead ends: 16 [2019-01-20 09:57:28,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 09:57:28,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-20 09:57:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-20 09:57:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 09:57:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-20 09:57:28,392 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-20 09:57:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:28,392 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-20 09:57:28,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 09:57:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-20 09:57:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-20 09:57:28,393 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:28,393 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-20 09:57:28,393 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:28,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:28,393 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-20 09:57:28,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:28,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:28,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:28,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:28,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:28,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:28,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:28,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:28,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:28,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:28,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:28,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:28,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:28,591 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:28,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:29,157 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:29,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-20 09:57:29,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:29,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 09:57:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 09:57:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 09:57:29,179 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-20 09:57:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:29,244 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-20 09:57:29,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 09:57:29,245 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-20 09:57:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:29,246 INFO L225 Difference]: With dead ends: 19 [2019-01-20 09:57:29,246 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 09:57:29,247 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 [2019-01-20 09:57:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 09:57:29,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 09:57:29,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 09:57:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-20 09:57:29,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-20 09:57:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:29,251 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-20 09:57:29,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 09:57:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-20 09:57:29,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 09:57:29,252 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:29,252 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-20 09:57:29,252 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-20 09:57:29,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:29,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:29,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:29,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:29,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:29,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:29,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:29,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:29,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:29,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:29,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:29,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-20 09:57:29,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:29,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 09:57:29,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 09:57:29,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 09:57:29,931 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-20 09:57:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:29,971 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-20 09:57:29,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 09:57:29,980 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-20 09:57:29,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:29,981 INFO L225 Difference]: With dead ends: 20 [2019-01-20 09:57:29,981 INFO L226 Difference]: Without dead ends: 18 [2019-01-20 09:57:29,981 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 [2019-01-20 09:57:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-20 09:57:29,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-20 09:57:29,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 09:57:29,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-20 09:57:29,986 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-20 09:57:29,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:29,987 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-20 09:57:29,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 09:57:29,987 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-20 09:57:29,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-20 09:57:29,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:29,987 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-20 09:57:29,988 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:29,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:29,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-20 09:57:29,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:29,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:29,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:30,381 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:30,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:30,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:30,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:30,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:30,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:30,394 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:30,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:30,420 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 09:57:30,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:30,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:30,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:30,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:30,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-20 09:57:30,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:30,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 09:57:30,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 09:57:30,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:30,801 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-20 09:57:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:30,830 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-20 09:57:30,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 09:57:30,831 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-20 09:57:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:30,832 INFO L225 Difference]: With dead ends: 21 [2019-01-20 09:57:30,832 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 09:57:30,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 09:57:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 09:57:30,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 09:57:30,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 09:57:30,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-20 09:57:30,835 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-20 09:57:30,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:30,836 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-20 09:57:30,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 09:57:30,836 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-20 09:57:30,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 09:57:30,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:30,837 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-20 09:57:30,837 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:30,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:30,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-20 09:57:30,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:30,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:30,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:30,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:31,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:31,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:31,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:31,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:31,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:31,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:31,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:31,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:31,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:31,115 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:31,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:31,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:31,721 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:31,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:31,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-20 09:57:31,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:31,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 09:57:31,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 09:57:31,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:31,741 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-20 09:57:31,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:31,864 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-20 09:57:31,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 09:57:31,864 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-20 09:57:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:31,865 INFO L225 Difference]: With dead ends: 22 [2019-01-20 09:57:31,865 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 09:57:31,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 09:57:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 09:57:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-20 09:57:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 09:57:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-20 09:57:31,868 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-20 09:57:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:31,869 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-20 09:57:31,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 09:57:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-20 09:57:31,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-20 09:57:31,870 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:31,870 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-20 09:57:31,870 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:31,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-20 09:57:31,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:31,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:31,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:32,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:32,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:32,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:32,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:32,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:32,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:32,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:32,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:32,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:32,742 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:32,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:33,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-20 09:57:33,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:33,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 09:57:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 09:57:33,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 09:57:33,374 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-20 09:57:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:33,401 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-20 09:57:33,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 09:57:33,401 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-20 09:57:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:33,402 INFO L225 Difference]: With dead ends: 23 [2019-01-20 09:57:33,402 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 09:57:33,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 09:57:33,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 09:57:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 09:57:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 09:57:33,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-20 09:57:33,405 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-20 09:57:33,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:33,406 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-20 09:57:33,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 09:57:33,406 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-20 09:57:33,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 09:57:33,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:33,406 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-20 09:57:33,407 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:33,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:33,407 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-20 09:57:33,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:33,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:33,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:33,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:33,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:33,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:33,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:33,604 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:33,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:33,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:33,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 09:57:33,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:33,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:33,649 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:33,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:34,747 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:34,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:34,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-20 09:57:34,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:34,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 09:57:34,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 09:57:34,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:34,768 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-20 09:57:34,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:34,794 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-20 09:57:34,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 09:57:34,796 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-20 09:57:34,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:34,796 INFO L225 Difference]: With dead ends: 24 [2019-01-20 09:57:34,796 INFO L226 Difference]: Without dead ends: 22 [2019-01-20 09:57:34,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 09:57:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-20 09:57:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-20 09:57:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 09:57:34,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-20 09:57:34,801 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-20 09:57:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:34,801 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-20 09:57:34,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 09:57:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-20 09:57:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-20 09:57:34,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:34,802 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-20 09:57:34,802 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-20 09:57:34,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:34,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:34,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:34,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:35,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:35,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:35,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:35,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:35,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:35,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:35,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:35,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:35,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:35,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:36,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-20 09:57:36,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:36,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 09:57:36,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 09:57:36,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:36,241 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-20 09:57:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:36,276 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-20 09:57:36,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 09:57:36,277 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-20 09:57:36,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:36,277 INFO L225 Difference]: With dead ends: 25 [2019-01-20 09:57:36,278 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 09:57:36,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 09:57:36,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 09:57:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 09:57:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 09:57:36,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-20 09:57:36,282 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-20 09:57:36,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:36,283 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-20 09:57:36,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 09:57:36,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-20 09:57:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 09:57:36,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:36,284 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-20 09:57:36,284 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-20 09:57:36,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:36,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:36,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:36,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:36,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:36,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:36,567 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:36,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:36,575 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:36,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:36,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:37,138 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:37,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:37,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-20 09:57:37,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:37,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 09:57:37,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 09:57:37,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 09:57:37,159 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-20 09:57:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:37,229 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-20 09:57:37,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 09:57:37,230 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-20 09:57:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:37,231 INFO L225 Difference]: With dead ends: 26 [2019-01-20 09:57:37,231 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 09:57:37,232 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 [2019-01-20 09:57:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 09:57:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-20 09:57:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 09:57:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-20 09:57:37,235 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-20 09:57:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:37,235 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-20 09:57:37,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 09:57:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-20 09:57:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-20 09:57:37,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:37,236 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-20 09:57:37,236 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-20 09:57:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:37,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:38,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:38,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:38,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:38,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:38,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:38,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:38,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 09:57:38,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:38,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:38,603 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:38,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:38,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-20 09:57:38,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:38,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 09:57:38,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 09:57:38,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:38,623 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-20 09:57:38,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:38,665 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-20 09:57:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 09:57:38,665 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-20 09:57:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:38,666 INFO L225 Difference]: With dead ends: 27 [2019-01-20 09:57:38,666 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 09:57:38,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 09:57:38,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 09:57:38,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 09:57:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 09:57:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-20 09:57:38,671 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-20 09:57:38,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:38,676 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-20 09:57:38,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 09:57:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-20 09:57:38,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 09:57:38,677 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:38,677 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-20 09:57:38,677 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:38,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:38,677 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-20 09:57:38,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:38,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:38,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:39,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:39,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:39,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:39,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:39,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:39,266 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:39,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:39,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:39,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:39,835 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-20 09:57:39,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:39,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 09:57:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 09:57:39,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:39,855 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-20 09:57:39,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:39,916 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-20 09:57:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 09:57:39,919 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-20 09:57:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:39,919 INFO L225 Difference]: With dead ends: 28 [2019-01-20 09:57:39,919 INFO L226 Difference]: Without dead ends: 26 [2019-01-20 09:57:39,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 09:57:39,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-20 09:57:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-20 09:57:39,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 09:57:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-20 09:57:39,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-20 09:57:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:39,924 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-20 09:57:39,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 09:57:39,924 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-20 09:57:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-20 09:57:39,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:39,924 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-20 09:57:39,925 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:39,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:39,925 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-20 09:57:39,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:39,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:39,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:40,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:40,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:40,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:40,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:40,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:40,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:40,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:40,262 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:40,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:41,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-20 09:57:41,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:41,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 09:57:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 09:57:41,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 09:57:41,120 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-20 09:57:41,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:41,164 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-20 09:57:41,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 09:57:41,164 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-20 09:57:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:41,165 INFO L225 Difference]: With dead ends: 29 [2019-01-20 09:57:41,165 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 09:57:41,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 09:57:41,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 09:57:41,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 09:57:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 09:57:41,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-20 09:57:41,170 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-20 09:57:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:41,171 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-20 09:57:41,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 09:57:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-20 09:57:41,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 09:57:41,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:41,172 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-20 09:57:41,172 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:41,172 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-20 09:57:41,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:41,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:41,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:41,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:41,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:41,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:41,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:41,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:41,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:41,540 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 09:57:41,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:41,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:41,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:42,361 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:42,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-20 09:57:42,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:42,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 09:57:42,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 09:57:42,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 09:57:42,383 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-20 09:57:42,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:42,431 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-20 09:57:42,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 09:57:42,431 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-20 09:57:42,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:42,432 INFO L225 Difference]: With dead ends: 30 [2019-01-20 09:57:42,432 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 09:57:42,434 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 [2019-01-20 09:57:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 09:57:42,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-20 09:57:42,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 09:57:42,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-20 09:57:42,438 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-20 09:57:42,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:42,438 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-20 09:57:42,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 09:57:42,438 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-20 09:57:42,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-20 09:57:42,439 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:42,439 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-20 09:57:42,439 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:42,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-20 09:57:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:42,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:42,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:42,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:42,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:42,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:42,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:42,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:42,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:42,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:42,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:43,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:43,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:43,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:43,024 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:43,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:43,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-20 09:57:43,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:43,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 09:57:43,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 09:57:43,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:57:43,779 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-20 09:57:43,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:43,832 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-20 09:57:43,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 09:57:43,833 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-20 09:57:43,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:43,833 INFO L225 Difference]: With dead ends: 31 [2019-01-20 09:57:43,833 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 09:57:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 09:57:43,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 09:57:43,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 09:57:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 09:57:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-20 09:57:43,838 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-20 09:57:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:43,839 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-20 09:57:43,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 09:57:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-20 09:57:43,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 09:57:43,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:43,839 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-20 09:57:43,840 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-20 09:57:43,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:43,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:43,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:43,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:43,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:44,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:44,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:44,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:44,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:44,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:44,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:44,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:44,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:44,553 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:44,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:45,891 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:45,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:45,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-20 09:57:45,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:45,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 09:57:45,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 09:57:45,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:45,913 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-20 09:57:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:46,007 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-20 09:57:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 09:57:46,007 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-20 09:57:46,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:46,008 INFO L225 Difference]: With dead ends: 32 [2019-01-20 09:57:46,008 INFO L226 Difference]: Without dead ends: 30 [2019-01-20 09:57:46,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 09:57:46,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-20 09:57:46,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-20 09:57:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-20 09:57:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-20 09:57:46,013 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-20 09:57:46,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:46,013 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-20 09:57:46,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 09:57:46,013 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-20 09:57:46,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-20 09:57:46,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:46,014 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-20 09:57:46,014 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:46,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-20 09:57:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:46,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:46,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:46,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:46,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:46,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:46,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:46,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:46,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:46,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:46,522 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 09:57:46,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:46,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:46,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:47,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:47,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-20 09:57:47,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:47,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 09:57:47,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 09:57:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:47,347 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-20 09:57:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:47,500 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-20 09:57:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 09:57:47,501 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-20 09:57:47,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:47,501 INFO L225 Difference]: With dead ends: 33 [2019-01-20 09:57:47,501 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 09:57:47,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 09:57:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 09:57:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 09:57:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 09:57:47,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-20 09:57:47,506 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-20 09:57:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:47,506 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-20 09:57:47,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 09:57:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-20 09:57:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 09:57:47,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:47,507 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-20 09:57:47,507 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:47,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:47,508 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-20 09:57:47,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:47,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:47,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:48,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:48,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:48,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:48,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:48,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:48,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:48,193 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:48,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:48,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:48,203 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:48,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:49,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-20 09:57:49,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:49,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 09:57:49,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 09:57:49,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:49,041 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-20 09:57:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:49,074 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-20 09:57:49,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 09:57:49,074 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-20 09:57:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:49,075 INFO L225 Difference]: With dead ends: 34 [2019-01-20 09:57:49,075 INFO L226 Difference]: Without dead ends: 32 [2019-01-20 09:57:49,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 09:57:49,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-20 09:57:49,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-20 09:57:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 09:57:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-20 09:57:49,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-20 09:57:49,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:49,080 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-20 09:57:49,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 09:57:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-20 09:57:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-20 09:57:49,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:49,081 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-20 09:57:49,081 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:49,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:49,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-20 09:57:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:49,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:49,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:49,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:49,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,706 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:49,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:49,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:49,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:49,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:49,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:49,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:49,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:49,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:50,756 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:50,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-20 09:57:50,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:50,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 09:57:50,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 09:57:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 09:57:50,778 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-20 09:57:50,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:50,868 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-20 09:57:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 09:57:50,869 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-20 09:57:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:50,869 INFO L225 Difference]: With dead ends: 35 [2019-01-20 09:57:50,869 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 09:57:50,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 09:57:50,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 09:57:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 09:57:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 09:57:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-20 09:57:50,875 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-20 09:57:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:50,875 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-20 09:57:50,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 09:57:50,876 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-20 09:57:50,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 09:57:50,878 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:50,878 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-20 09:57:50,878 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-20 09:57:50,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:50,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:50,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:51,309 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:51,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:51,310 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:51,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:51,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:51,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:51,318 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:51,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:51,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 09:57:51,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:51,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:51,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:52,412 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:52,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:52,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-20 09:57:52,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:52,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 09:57:52,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 09:57:52,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:52,432 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-20 09:57:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:52,483 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-20 09:57:52,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 09:57:52,483 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-20 09:57:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:52,484 INFO L225 Difference]: With dead ends: 36 [2019-01-20 09:57:52,484 INFO L226 Difference]: Without dead ends: 34 [2019-01-20 09:57:52,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 09:57:52,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-20 09:57:52,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-20 09:57:52,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 09:57:52,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-20 09:57:52,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-20 09:57:52,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:52,488 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-20 09:57:52,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 09:57:52,488 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-20 09:57:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-20 09:57:52,489 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:52,489 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-20 09:57:52,489 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:52,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-20 09:57:52,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:52,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:52,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:52,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:52,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:52,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:53,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:53,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:53,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:53,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:53,106 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:53,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:53,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:53,137 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:53,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:53,146 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:53,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:54,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-20 09:57:54,214 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:54,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 09:57:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 09:57:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:54,215 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-20 09:57:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:54,328 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-20 09:57:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 09:57:54,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-20 09:57:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:54,329 INFO L225 Difference]: With dead ends: 37 [2019-01-20 09:57:54,329 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 09:57:54,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 09:57:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 09:57:54,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 09:57:54,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 09:57:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-20 09:57:54,333 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-20 09:57:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:54,334 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-20 09:57:54,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 09:57:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-20 09:57:54,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 09:57:54,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:54,334 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-20 09:57:54,335 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:54,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:54,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-20 09:57:54,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:54,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:54,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:54,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:54,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:54,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:54,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:54,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:54,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:54,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:57:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:54,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:54,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:56,055 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:56,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:56,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-20 09:57:56,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:56,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 09:57:56,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 09:57:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 09:57:56,075 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-20 09:57:56,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:56,143 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-20 09:57:56,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 09:57:56,144 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-20 09:57:56,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:56,144 INFO L225 Difference]: With dead ends: 38 [2019-01-20 09:57:56,144 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 09:57:56,145 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 [2019-01-20 09:57:56,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 09:57:56,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-20 09:57:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-20 09:57:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-20 09:57:56,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-20 09:57:56,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:56,148 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-20 09:57:56,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 09:57:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-20 09:57:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-20 09:57:56,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:56,149 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-20 09:57:56,149 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:56,150 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-20 09:57:56,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:56,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:57:56,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:56,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:56,895 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:56,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:56,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:56,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:56,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:56,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:56,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:57:56,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:57:57,001 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 09:57:57,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:57,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:57,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:57:58,222 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:57:58,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-20 09:57:58,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:57:58,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 09:57:58,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 09:57:58,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:57:58,242 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-20 09:57:58,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:57:58,306 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-20 09:57:58,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 09:57:58,306 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-20 09:57:58,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:57:58,307 INFO L225 Difference]: With dead ends: 39 [2019-01-20 09:57:58,307 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 09:57:58,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 09:57:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 09:57:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 09:57:58,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 09:57:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-20 09:57:58,311 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-20 09:57:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:57:58,311 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-20 09:57:58,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 09:57:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-20 09:57:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 09:57:58,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:57:58,312 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-20 09:57:58,312 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:57:58,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:57:58,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-20 09:57:58,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:57:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:57:58,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:57:58,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:57:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:57:58,826 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:57:58,826 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:57:58,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:57:58,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:57:58,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:57:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:57:58,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:57:58,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:57:58,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:57:58,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:57:58,882 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:57:58,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:00,429 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:00,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-20 09:58:00,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:00,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 09:58:00,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 09:58:00,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:00,450 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-20 09:58:00,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:00,580 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-20 09:58:00,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 09:58:00,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-20 09:58:00,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:00,581 INFO L225 Difference]: With dead ends: 40 [2019-01-20 09:58:00,581 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 09:58:00,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 09:58:00,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 09:58:00,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-20 09:58:00,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 09:58:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-20 09:58:00,584 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-20 09:58:00,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:00,584 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-20 09:58:00,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 09:58:00,584 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-20 09:58:00,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-20 09:58:00,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:00,585 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-20 09:58:00,585 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:00,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:00,585 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-20 09:58:00,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:00,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:00,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:01,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:01,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:01,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:01,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:01,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:01,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:01,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:01,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:01,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:01,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:02,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-20 09:58:02,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:02,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 09:58:02,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 09:58:02,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 09:58:02,464 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-20 09:58:02,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:02,532 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-20 09:58:02,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 09:58:02,532 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-20 09:58:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:02,533 INFO L225 Difference]: With dead ends: 41 [2019-01-20 09:58:02,533 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 09:58:02,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 09:58:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 09:58:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 09:58:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 09:58:02,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-20 09:58:02,535 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-20 09:58:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:02,536 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-20 09:58:02,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 09:58:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-20 09:58:02,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 09:58:02,536 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:02,536 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-20 09:58:02,537 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:02,537 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-20 09:58:02,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:02,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:02,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:03,230 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:03,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:03,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:03,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:03,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:03,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:03,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:03,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:03,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:03,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 09:58:03,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:03,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:03,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:05,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:05,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-20 09:58:05,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:05,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 09:58:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 09:58:05,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:05,081 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-20 09:58:05,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:05,129 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-20 09:58:05,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 09:58:05,130 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-20 09:58:05,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:05,130 INFO L225 Difference]: With dead ends: 42 [2019-01-20 09:58:05,130 INFO L226 Difference]: Without dead ends: 40 [2019-01-20 09:58:05,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 09:58:05,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-20 09:58:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-20 09:58:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 09:58:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-20 09:58:05,133 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-20 09:58:05,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:05,133 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-20 09:58:05,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 09:58:05,133 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-20 09:58:05,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-20 09:58:05,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:05,134 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-20 09:58:05,134 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:05,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:05,135 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-20 09:58:05,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:05,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:05,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:05,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:05,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:06,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:06,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:06,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:06,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:06,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:06,355 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:06,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:06,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:06,399 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:06,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:06,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:06,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:07,894 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:07,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:07,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-20 09:58:07,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:07,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 09:58:07,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 09:58:07,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 09:58:07,914 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-20 09:58:07,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:07,971 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-20 09:58:07,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 09:58:07,971 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-20 09:58:07,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:07,972 INFO L225 Difference]: With dead ends: 43 [2019-01-20 09:58:07,972 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 09:58:07,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 09:58:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 09:58:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 09:58:07,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 09:58:07,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-20 09:58:07,975 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-20 09:58:07,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:07,975 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-20 09:58:07,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 09:58:07,976 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-20 09:58:07,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 09:58:07,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:07,977 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-20 09:58:07,977 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:07,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:07,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-20 09:58:07,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:07,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:07,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:08,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:08,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:08,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:08,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:08,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:08,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:08,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:08,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:08,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:08,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:10,636 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:10,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-20 09:58:10,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:10,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 09:58:10,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 09:58:10,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:10,655 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-20 09:58:10,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:10,730 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-20 09:58:10,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 09:58:10,731 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-20 09:58:10,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:10,732 INFO L225 Difference]: With dead ends: 44 [2019-01-20 09:58:10,732 INFO L226 Difference]: Without dead ends: 42 [2019-01-20 09:58:10,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 09:58:10,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-20 09:58:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-20 09:58:10,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 09:58:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-20 09:58:10,735 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-20 09:58:10,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:10,736 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-20 09:58:10,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 09:58:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-20 09:58:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-20 09:58:10,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:10,736 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-20 09:58:10,737 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:10,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:10,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-20 09:58:10,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:10,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:11,522 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:11,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:11,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:11,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:11,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:11,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:11,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:11,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:11,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 09:58:11,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:11,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:11,647 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:11,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:13,268 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:13,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:13,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-20 09:58:13,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:13,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 09:58:13,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 09:58:13,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:13,288 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-20 09:58:13,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:13,343 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-20 09:58:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 09:58:13,344 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-20 09:58:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:13,345 INFO L225 Difference]: With dead ends: 45 [2019-01-20 09:58:13,345 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 09:58:13,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 09:58:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 09:58:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 09:58:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 09:58:13,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-20 09:58:13,348 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-20 09:58:13,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:13,348 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-20 09:58:13,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 09:58:13,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-20 09:58:13,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 09:58:13,349 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:13,349 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-20 09:58:13,349 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:13,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:13,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-20 09:58:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:13,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:13,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:13,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:14,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:14,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:14,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:14,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:14,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:14,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:14,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:14,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:14,094 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:14,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:14,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:14,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:16,007 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:16,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:16,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-20 09:58:16,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:16,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 09:58:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 09:58:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:58:16,026 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-20 09:58:16,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:16,096 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-20 09:58:16,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 09:58:16,096 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-20 09:58:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:16,097 INFO L225 Difference]: With dead ends: 46 [2019-01-20 09:58:16,097 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 09:58:16,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 09:58:16,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 09:58:16,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-20 09:58:16,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-20 09:58:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-20 09:58:16,099 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-20 09:58:16,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:16,099 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-20 09:58:16,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 09:58:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-20 09:58:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-20 09:58:16,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:16,099 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-20 09:58:16,100 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:16,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:16,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-20 09:58:16,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:16,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:16,101 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:16,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:16,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:16,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:16,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:16,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:16,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:16,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:16,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:16,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:16,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:16,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:16,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:18,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:18,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-20 09:58:18,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:18,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 09:58:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 09:58:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 09:58:18,663 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-20 09:58:18,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:18,761 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-20 09:58:18,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 09:58:18,761 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-20 09:58:18,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:18,762 INFO L225 Difference]: With dead ends: 47 [2019-01-20 09:58:18,762 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 09:58:18,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 09:58:18,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 09:58:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 09:58:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 09:58:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-20 09:58:18,764 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-20 09:58:18,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:18,764 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-20 09:58:18,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 09:58:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-20 09:58:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 09:58:18,765 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:18,765 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-20 09:58:18,765 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-20 09:58:18,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:18,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:18,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:18,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:19,584 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:19,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:19,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:19,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:19,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:19,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:19,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:19,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:19,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 09:58:19,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:19,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:19,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:22,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-20 09:58:22,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:22,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 09:58:22,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 09:58:22,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:22,016 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-20 09:58:22,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:22,087 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-20 09:58:22,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 09:58:22,087 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-20 09:58:22,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:22,088 INFO L225 Difference]: With dead ends: 48 [2019-01-20 09:58:22,088 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 09:58:22,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 09:58:22,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 09:58:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-20 09:58:22,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-20 09:58:22,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-20 09:58:22,090 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-20 09:58:22,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:22,091 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-20 09:58:22,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 09:58:22,091 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-20 09:58:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-20 09:58:22,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:22,091 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-20 09:58:22,091 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:22,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-20 09:58:22,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:22,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:22,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:22,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:22,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:22,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:22,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:22,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:22,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:22,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:22,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:22,867 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:22,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:22,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:22,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:24,877 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:24,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:24,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-20 09:58:24,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:24,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 09:58:24,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 09:58:24,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:58:24,897 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-20 09:58:24,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:24,957 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-20 09:58:24,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 09:58:24,958 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-20 09:58:24,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:24,958 INFO L225 Difference]: With dead ends: 49 [2019-01-20 09:58:24,958 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 09:58:24,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 09:58:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 09:58:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 09:58:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 09:58:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-20 09:58:24,961 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-20 09:58:24,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:24,962 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-20 09:58:24,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 09:58:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-20 09:58:24,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 09:58:24,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:24,963 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-20 09:58:24,963 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:24,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-20 09:58:24,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:24,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:24,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:24,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:25,969 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:25,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:25,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:25,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:25,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:25,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:25,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:26,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:26,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:28,119 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:28,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:28,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-20 09:58:28,139 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:28,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 09:58:28,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 09:58:28,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:28,140 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-20 09:58:28,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:28,227 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-20 09:58:28,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 09:58:28,228 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-20 09:58:28,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:28,228 INFO L225 Difference]: With dead ends: 50 [2019-01-20 09:58:28,228 INFO L226 Difference]: Without dead ends: 48 [2019-01-20 09:58:28,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 09:58:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-20 09:58:28,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-20 09:58:28,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 09:58:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-20 09:58:28,231 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-20 09:58:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:28,231 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-20 09:58:28,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 09:58:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-20 09:58:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-20 09:58:28,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:28,232 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-20 09:58:28,232 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-20 09:58:28,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:28,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:28,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:29,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:29,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:29,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:29,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:29,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:29,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:29,201 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 09:58:29,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:29,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:29,215 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:29,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:31,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:31,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-20 09:58:31,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:31,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 09:58:31,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 09:58:31,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:31,592 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-20 09:58:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:31,715 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-20 09:58:31,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 09:58:31,716 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-20 09:58:31,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:31,717 INFO L225 Difference]: With dead ends: 51 [2019-01-20 09:58:31,717 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 09:58:31,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 09:58:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 09:58:31,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 09:58:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 09:58:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-20 09:58:31,721 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-20 09:58:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:31,721 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-20 09:58:31,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 09:58:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-20 09:58:31,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 09:58:31,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:31,722 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-20 09:58:31,723 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:31,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:31,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-20 09:58:31,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:31,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:31,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:31,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:32,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:32,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:32,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:32,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:32,593 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:32,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:32,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:32,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:32,604 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:32,647 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:32,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:32,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:32,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:34,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:34,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:34,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-20 09:58:34,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:34,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 09:58:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 09:58:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:34,939 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-20 09:58:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:35,277 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-20 09:58:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 09:58:35,277 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-20 09:58:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:35,277 INFO L225 Difference]: With dead ends: 52 [2019-01-20 09:58:35,278 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 09:58:35,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 09:58:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 09:58:35,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-20 09:58:35,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-20 09:58:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-20 09:58:35,280 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-20 09:58:35,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:35,281 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-20 09:58:35,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 09:58:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-20 09:58:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-20 09:58:35,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:35,281 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-20 09:58:35,281 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:35,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:35,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-20 09:58:35,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:35,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:35,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:35,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:35,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:36,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:36,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:36,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:36,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:36,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:36,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:36,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:36,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:36,295 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:38,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:38,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:38,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-20 09:58:38,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:38,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 09:58:38,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 09:58:38,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 09:58:38,647 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-20 09:58:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:38,739 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-20 09:58:38,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 09:58:38,739 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-20 09:58:38,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:38,740 INFO L225 Difference]: With dead ends: 53 [2019-01-20 09:58:38,740 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 09:58:38,741 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 [2019-01-20 09:58:38,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 09:58:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 09:58:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 09:58:38,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-20 09:58:38,744 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-20 09:58:38,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:38,744 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-20 09:58:38,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 09:58:38,744 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-20 09:58:38,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 09:58:38,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:38,745 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-20 09:58:38,745 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:38,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:38,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-20 09:58:38,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:38,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:38,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:38,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:38,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:39,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:39,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:39,946 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:39,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:39,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:39,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:39,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:39,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:40,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 09:58:40,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:40,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:40,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:42,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:42,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:42,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-20 09:58:42,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:42,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 09:58:42,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 09:58:42,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:42,807 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-20 09:58:42,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:42,867 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-20 09:58:42,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 09:58:42,868 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-20 09:58:42,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:42,868 INFO L225 Difference]: With dead ends: 54 [2019-01-20 09:58:42,868 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 09:58:42,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 09:58:42,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 09:58:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-20 09:58:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 09:58:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-20 09:58:42,871 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-20 09:58:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-20 09:58:42,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 09:58:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-20 09:58:42,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-20 09:58:42,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:42,873 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-20 09:58:42,873 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:42,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:42,873 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-20 09:58:42,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:42,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:42,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:42,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:43,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:43,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:43,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:43,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:43,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:43,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:43,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:43,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:43,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:43,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:43,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:43,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:46,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:46,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:46,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-20 09:58:46,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:46,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 09:58:46,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 09:58:46,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 09:58:46,667 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-20 09:58:46,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:46,804 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-20 09:58:46,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 09:58:46,804 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-20 09:58:46,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:46,805 INFO L225 Difference]: With dead ends: 55 [2019-01-20 09:58:46,805 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 09:58:46,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 09:58:46,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 09:58:46,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 09:58:46,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 09:58:46,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-20 09:58:46,808 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-20 09:58:46,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:46,808 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-20 09:58:46,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 09:58:46,809 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-20 09:58:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 09:58:46,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:46,809 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-20 09:58:46,809 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:46,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:46,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-20 09:58:46,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:46,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:46,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:46,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:47,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:47,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:47,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:47,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:47,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:47,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:47,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:47,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:47,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:58:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:47,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:47,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:50,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:50,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:50,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-20 09:58:50,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:50,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 09:58:50,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 09:58:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:58:50,910 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-20 09:58:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:50,999 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-20 09:58:50,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 09:58:50,999 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-20 09:58:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:51,000 INFO L225 Difference]: With dead ends: 56 [2019-01-20 09:58:51,000 INFO L226 Difference]: Without dead ends: 54 [2019-01-20 09:58:51,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 09:58:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-20 09:58:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-20 09:58:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 09:58:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-20 09:58:51,003 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-20 09:58:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:51,003 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-20 09:58:51,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 09:58:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-20 09:58:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-20 09:58:51,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:51,004 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-20 09:58:51,004 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:51,004 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-20 09:58:51,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:51,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:51,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:58:51,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:51,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:52,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:52,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:52,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:52,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:52,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:52,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:52,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:58:52,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:58:52,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 09:58:52,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:52,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:52,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:52,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:55,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:55,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-20 09:58:55,188 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:55,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 09:58:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 09:58:55,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:58:55,190 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-20 09:58:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:55,340 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-20 09:58:55,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 09:58:55,340 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-20 09:58:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:55,341 INFO L225 Difference]: With dead ends: 57 [2019-01-20 09:58:55,341 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 09:58:55,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 09:58:55,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 09:58:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 09:58:55,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 09:58:55,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-20 09:58:55,344 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-20 09:58:55,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:55,344 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-20 09:58:55,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 09:58:55,344 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-20 09:58:55,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 09:58:55,345 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:55,345 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-20 09:58:55,345 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:55,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:55,345 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-20 09:58:55,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:55,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:55,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:55,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:58:56,740 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:56,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:56,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:58:56,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:58:56,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:58:56,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:58:56,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:58:56,750 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:58:56,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:58:56,796 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:58:56,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:58:56,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:58:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:56,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:58:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:58:59,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:58:59,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-20 09:58:59,568 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:58:59,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 09:58:59,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 09:58:59,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:58:59,569 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-20 09:58:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:58:59,666 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-20 09:58:59,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 09:58:59,667 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-20 09:58:59,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:58:59,668 INFO L225 Difference]: With dead ends: 58 [2019-01-20 09:58:59,668 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 09:58:59,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 09:58:59,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 09:58:59,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-20 09:58:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 09:58:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-20 09:58:59,671 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-20 09:58:59,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:58:59,672 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-20 09:58:59,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 09:58:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-20 09:58:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-20 09:58:59,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:58:59,672 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-20 09:58:59,673 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:58:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:58:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-20 09:58:59,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:58:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:59,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:58:59,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:58:59,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:58:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:00,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:00,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:00,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:00,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:00,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:00,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:00,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:00,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:00,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:00,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:00,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:03,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:03,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-20 09:59:03,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:03,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 09:59:03,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 09:59:03,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 09:59:03,896 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-20 09:59:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:03,995 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-20 09:59:03,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 09:59:03,995 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-20 09:59:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:03,996 INFO L225 Difference]: With dead ends: 59 [2019-01-20 09:59:03,996 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 09:59:03,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 09:59:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 09:59:03,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 09:59:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 09:59:03,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-20 09:59:03,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-20 09:59:03,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:03,999 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-20 09:59:03,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 09:59:03,999 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-20 09:59:04,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 09:59:04,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:04,000 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-20 09:59:04,000 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:04,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:04,001 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-20 09:59:04,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:04,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:04,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:04,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:04,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:05,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:05,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:05,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:05,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:05,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:05,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:05,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:05,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:05,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:05,495 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-20 09:59:05,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:05,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:05,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:08,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:08,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:08,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-20 09:59:08,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:08,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 09:59:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 09:59:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:08,827 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-20 09:59:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:08,895 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-20 09:59:08,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 09:59:08,896 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-20 09:59:08,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:08,897 INFO L225 Difference]: With dead ends: 60 [2019-01-20 09:59:08,897 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 09:59:08,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 09:59:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 09:59:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-20 09:59:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 09:59:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-20 09:59:08,900 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-20 09:59:08,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:08,900 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-20 09:59:08,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 09:59:08,900 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-20 09:59:08,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-20 09:59:08,901 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:08,901 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-20 09:59:08,901 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-20 09:59:08,901 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,902 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:08,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:08,902 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:10,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:10,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:10,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:10,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:10,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:10,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:10,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:10,133 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:10,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:10,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:10,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:10,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:13,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:13,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:13,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-20 09:59:13,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:13,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-20 09:59:13,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-20 09:59:13,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 09:59:13,513 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-20 09:59:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:13,620 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-20 09:59:13,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 09:59:13,620 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-20 09:59:13,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:13,621 INFO L225 Difference]: With dead ends: 61 [2019-01-20 09:59:13,621 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 09:59:13,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 09:59:13,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 09:59:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 09:59:13,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 09:59:13,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-20 09:59:13,623 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-20 09:59:13,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:13,624 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-20 09:59:13,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-20 09:59:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-20 09:59:13,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 09:59:13,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:13,624 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-20 09:59:13,625 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:13,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:13,625 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-20 09:59:13,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:13,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:13,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:13,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:13,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:14,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:14,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:14,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:14,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:14,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:14,876 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:14,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:14,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:14,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:14,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:14,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:18,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:18,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:18,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-20 09:59:18,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:18,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 09:59:18,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 09:59:18,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 09:59:18,399 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-20 09:59:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:18,513 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-20 09:59:18,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 09:59:18,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-20 09:59:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:18,514 INFO L225 Difference]: With dead ends: 62 [2019-01-20 09:59:18,514 INFO L226 Difference]: Without dead ends: 60 [2019-01-20 09:59:18,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 09:59:18,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-20 09:59:18,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-20 09:59:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-20 09:59:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-20 09:59:18,518 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-20 09:59:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:18,518 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-20 09:59:18,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 09:59:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-20 09:59:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-20 09:59:18,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:18,518 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-20 09:59:18,519 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-20 09:59:18,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:18,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:18,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:18,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:18,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:19,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:19,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:19,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:19,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:19,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:19,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:19,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:19,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:20,028 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 09:59:20,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:20,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:20,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:23,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:23,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-20 09:59:23,653 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:23,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 09:59:23,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 09:59:23,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:23,654 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-20 09:59:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:23,729 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-20 09:59:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 09:59:23,730 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-20 09:59:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:23,730 INFO L225 Difference]: With dead ends: 63 [2019-01-20 09:59:23,731 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 09:59:23,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 09:59:23,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 09:59:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 09:59:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 09:59:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-20 09:59:23,735 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-20 09:59:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:23,735 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-20 09:59:23,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 09:59:23,735 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-20 09:59:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 09:59:23,736 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:23,736 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-20 09:59:23,736 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:23,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-20 09:59:23,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:23,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:23,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:25,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:25,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:25,092 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:25,092 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:25,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:25,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:25,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:25,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:25,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:25,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:25,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:25,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:29,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:29,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:29,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-20 09:59:29,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:29,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 09:59:29,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 09:59:29,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:29,708 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-20 09:59:29,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:29,817 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-20 09:59:29,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 09:59:29,817 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-20 09:59:29,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:29,818 INFO L225 Difference]: With dead ends: 64 [2019-01-20 09:59:29,818 INFO L226 Difference]: Without dead ends: 62 [2019-01-20 09:59:29,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 09:59:29,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-20 09:59:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-20 09:59:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-20 09:59:29,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-20 09:59:29,823 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-20 09:59:29,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:29,823 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-20 09:59:29,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 09:59:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-20 09:59:29,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-20 09:59:29,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:29,824 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-20 09:59:29,824 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:29,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-20 09:59:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:29,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:29,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:32,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:32,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:32,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:32,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:32,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:32,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:32,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:32,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:32,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:33,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:33,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:33,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:37,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:37,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:37,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-20 09:59:37,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:37,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-20 09:59:37,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-20 09:59:37,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 09:59:37,186 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-20 09:59:37,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:37,279 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-20 09:59:37,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 09:59:37,279 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-20 09:59:37,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:37,280 INFO L225 Difference]: With dead ends: 65 [2019-01-20 09:59:37,280 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 09:59:37,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 09:59:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 09:59:37,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 09:59:37,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 09:59:37,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-20 09:59:37,284 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-20 09:59:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:37,284 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-20 09:59:37,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-20 09:59:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-20 09:59:37,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 09:59:37,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:37,285 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-20 09:59:37,285 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-20 09:59:37,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:37,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:37,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:37,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:37,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:39,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:39,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:39,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:39,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:39,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:39,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:39,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:39,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:39,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-20 09:59:39,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:39,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:39,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:39,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:44,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:44,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:44,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-20 09:59:44,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:44,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 09:59:44,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 09:59:44,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:44,041 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-20 09:59:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:44,119 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-20 09:59:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 09:59:44,119 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-20 09:59:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:44,120 INFO L225 Difference]: With dead ends: 66 [2019-01-20 09:59:44,120 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 09:59:44,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 09:59:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 09:59:44,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-20 09:59:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 09:59:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-20 09:59:44,123 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-20 09:59:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:44,123 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-20 09:59:44,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 09:59:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-20 09:59:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-20 09:59:44,124 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:44,124 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-20 09:59:44,124 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:44,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:44,124 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-20 09:59:44,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:44,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:44,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:44,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:44,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:44,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:45,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:45,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:45,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:45,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:45,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:45,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:45,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 09:59:45,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 09:59:45,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 09:59:45,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:45,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:45,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:49,716 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:49,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:49,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-20 09:59:49,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:49,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-20 09:59:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-20 09:59:49,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 09:59:49,736 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-20 09:59:49,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:49,891 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-20 09:59:49,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 09:59:49,891 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-20 09:59:49,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:49,892 INFO L225 Difference]: With dead ends: 67 [2019-01-20 09:59:49,892 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 09:59:49,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 09:59:49,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 09:59:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 09:59:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 09:59:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-20 09:59:49,894 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-20 09:59:49,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:49,894 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-20 09:59:49,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-20 09:59:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-20 09:59:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 09:59:49,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:49,895 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-20 09:59:49,895 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:49,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-20 09:59:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:49,896 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 09:59:49,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:49,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:51,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:51,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:51,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:51,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:51,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:51,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:51,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:51,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 09:59:51,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:51,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:51,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 09:59:55,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:55,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 09:59:55,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-20 09:59:55,770 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 09:59:55,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 09:59:55,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 09:59:55,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 09:59:55,772 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-20 09:59:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 09:59:55,908 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-20 09:59:55,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 09:59:55,909 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-20 09:59:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 09:59:55,909 INFO L225 Difference]: With dead ends: 68 [2019-01-20 09:59:55,909 INFO L226 Difference]: Without dead ends: 66 [2019-01-20 09:59:55,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 09:59:55,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-20 09:59:55,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-20 09:59:55,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-20 09:59:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-20 09:59:55,912 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-20 09:59:55,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 09:59:55,912 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-20 09:59:55,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 09:59:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-20 09:59:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-20 09:59:55,912 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 09:59:55,912 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-20 09:59:55,912 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 09:59:55,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 09:59:55,913 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-20 09:59:55,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 09:59:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:55,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 09:59:55,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 09:59:55,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 09:59:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 09:59:57,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:57,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:57,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 09:59:57,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 09:59:57,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 09:59:57,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 09:59:57,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 09:59:57,880 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 09:59:57,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 09:59:58,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 09:59:58,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 09:59:58,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 09:59:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 09:59:58,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:02,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-20 10:00:02,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:02,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:00:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:00:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:00:02,553 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-20 10:00:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:02,717 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-20 10:00:02,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:00:02,717 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-20 10:00:02,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:02,717 INFO L225 Difference]: With dead ends: 69 [2019-01-20 10:00:02,717 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:00:02,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:00:02,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:00:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 10:00:02,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:00:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-20 10:00:02,721 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-20 10:00:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:02,722 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-20 10:00:02,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:00:02,722 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-20 10:00:02,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 10:00:02,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:02,722 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-20 10:00:02,723 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:02,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:02,723 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-20 10:00:02,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:02,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:02,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:02,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:02,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:04,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:04,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:04,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:04,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:04,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:04,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:04,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:04,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:04,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:04,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:04,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:04,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:04,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:04,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:08,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:08,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:08,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-20 10:00:08,775 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:08,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 10:00:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 10:00:08,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:00:08,777 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-20 10:00:08,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:08,895 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-20 10:00:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:00:08,897 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-20 10:00:08,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:08,898 INFO L225 Difference]: With dead ends: 70 [2019-01-20 10:00:08,898 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:00:08,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:00:08,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:00:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-20 10:00:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:00:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-20 10:00:08,903 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-20 10:00:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:08,903 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-20 10:00:08,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 10:00:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-20 10:00:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-20 10:00:08,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:08,904 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-20 10:00:08,904 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:08,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-20 10:00:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:08,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:08,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:08,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:10,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:10,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:10,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:10,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:10,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:10,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:10,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:10,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:10,553 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:10,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:10,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:15,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:15,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-20 10:00:15,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:15,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-20 10:00:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-20 10:00:15,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:00:15,129 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-20 10:00:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:15,215 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-20 10:00:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:00:15,215 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-20 10:00:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:15,216 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:00:15,216 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:00:15,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:00:15,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:00:15,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 10:00:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:00:15,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-20 10:00:15,219 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-20 10:00:15,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:15,219 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-20 10:00:15,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-20 10:00:15,220 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-20 10:00:15,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:00:15,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:15,220 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-20 10:00:15,220 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:15,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:15,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-20 10:00:15,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:15,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:15,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:15,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:17,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:17,475 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:17,475 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:17,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:17,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:17,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:17,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:17,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:17,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:00:17,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:17,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:17,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:17,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:22,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:22,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:22,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-20 10:00:22,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:22,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 10:00:22,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 10:00:22,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:22,515 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-20 10:00:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:22,626 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-20 10:00:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:00:22,626 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-20 10:00:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:22,627 INFO L225 Difference]: With dead ends: 72 [2019-01-20 10:00:22,627 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:00:22,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:00:22,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:00:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-20 10:00:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-20 10:00:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-20 10:00:22,630 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-20 10:00:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-20 10:00:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 10:00:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-20 10:00:22,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-20 10:00:22,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:22,631 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-20 10:00:22,631 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:22,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:22,632 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-20 10:00:22,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:22,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:22,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:22,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:24,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:24,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:24,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:24,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:24,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:24,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:24,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:24,499 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:24,499 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:24,560 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:24,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:24,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:24,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:30,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:30,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:30,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-20 10:00:30,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:30,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-20 10:00:30,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-20 10:00:30,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:00:30,256 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-20 10:00:30,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:30,550 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-20 10:00:30,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:00:30,551 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-20 10:00:30,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:30,551 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:00:30,551 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:00:30,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:00:30,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:00:30,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 10:00:30,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:00:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-20 10:00:30,554 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-20 10:00:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:30,554 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-20 10:00:30,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-20 10:00:30,554 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-20 10:00:30,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 10:00:30,555 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:30,555 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-20 10:00:30,555 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:30,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:30,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-20 10:00:30,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:30,556 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:30,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:30,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:32,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:32,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:32,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:32,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:32,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:32,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:32,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:32,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:32,281 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:32,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:32,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:37,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:37,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:37,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-20 10:00:37,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:37,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:00:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:00:37,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:00:37,553 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-20 10:00:37,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:37,645 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-20 10:00:37,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:00:37,646 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-20 10:00:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:37,647 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:00:37,647 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:00:37,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:00:37,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:00:37,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-20 10:00:37,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-20 10:00:37,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-20 10:00:37,650 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-20 10:00:37,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:37,651 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-20 10:00:37,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:00:37,651 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-20 10:00:37,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-20 10:00:37,651 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:37,651 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-20 10:00:37,651 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:37,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:37,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-20 10:00:37,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:37,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:37,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:37,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:39,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:39,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:39,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:39,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:39,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:39,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:39,555 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:00:39,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:00:40,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-20 10:00:40,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:40,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:40,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:45,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:45,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:45,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-20 10:00:45,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:45,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:00:45,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:00:45,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:00:45,289 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-20 10:00:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:45,492 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-20 10:00:45,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:00:45,493 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-20 10:00:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:45,493 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:00:45,493 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:00:45,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:00:45,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:00:45,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 10:00:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:00:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-20 10:00:45,496 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-20 10:00:45,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:45,496 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-20 10:00:45,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:00:45,496 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-20 10:00:45,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:00:45,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:45,497 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-20 10:00:45,497 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:45,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:45,497 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-20 10:00:45,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:45,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:45,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:45,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:45,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:47,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:47,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:47,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:47,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:47,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:47,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:47,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:47,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:00:47,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:00:47,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:00:47,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:00:47,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:47,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:00:52,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:52,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:00:52,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-20 10:00:52,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:00:52,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 10:00:52,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 10:00:52,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:00:52,696 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-20 10:00:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:00:52,828 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-20 10:00:52,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:00:52,828 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-20 10:00:52,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:00:52,829 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:00:52,829 INFO L226 Difference]: Without dead ends: 74 [2019-01-20 10:00:52,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:00:52,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-20 10:00:52,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-20 10:00:52,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:00:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-20 10:00:52,834 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-20 10:00:52,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:00:52,834 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-20 10:00:52,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 10:00:52,834 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-20 10:00:52,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-20 10:00:52,835 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:00:52,835 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-20 10:00:52,835 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:00:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:00:52,836 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-20 10:00:52,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:00:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:52,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:00:52,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:00:52,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:00:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:54,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:54,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:00:54,888 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:00:54,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:00:54,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:00:54,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:00:54,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:00:54,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:00:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:00:54,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:00:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:00:54,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:00,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:00,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:00,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-20 10:01:00,368 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:00,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-20 10:01:00,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-20 10:01:00,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:01:00,370 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-20 10:01:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:00,578 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-20 10:01:00,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:01:00,579 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-20 10:01:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:00,580 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:01:00,580 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:01:00,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:01:00,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:01:00,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 10:01:00,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:01:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-20 10:01:00,584 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-20 10:01:00,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:00,585 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-20 10:01:00,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-20 10:01:00,585 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-20 10:01:00,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 10:01:00,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:00,586 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-20 10:01:00,586 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:00,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:00,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-20 10:01:00,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:00,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:00,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:00,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:00,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:02,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:02,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:02,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:02,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:02,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:02,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:02,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:02,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:03,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-20 10:01:03,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:03,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:03,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:08,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:08,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:08,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-20 10:01:08,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:08,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:01:08,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:01:08,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:01:08,728 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-20 10:01:08,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:08,933 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-20 10:01:08,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:01:08,934 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-20 10:01:08,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:08,935 INFO L225 Difference]: With dead ends: 78 [2019-01-20 10:01:08,935 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:01:08,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:01:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:01:08,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-20 10:01:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:01:08,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-20 10:01:08,938 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-20 10:01:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:08,939 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-20 10:01:08,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:01:08,939 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-20 10:01:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-20 10:01:08,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:08,939 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-20 10:01:08,940 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-20 10:01:08,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:08,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:08,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:08,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:08,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:10,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:10,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:10,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:10,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:10,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:10,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:10,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:10,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:10,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:10,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:10,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:11,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:16,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:16,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-20 10:01:16,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:16,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:01:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:01:16,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:01:16,828 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-20 10:01:16,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:16,973 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-20 10:01:16,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:01:16,973 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-20 10:01:16,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:16,974 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:01:16,974 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:01:16,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:01:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:01:16,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 10:01:16,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:01:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-20 10:01:16,977 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-20 10:01:16,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:16,977 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-20 10:01:16,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:01:16,977 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-20 10:01:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:01:16,978 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:16,978 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-20 10:01:16,978 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:16,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:16,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-20 10:01:16,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:16,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:16,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:18,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:18,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:18,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:18,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:18,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:18,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:18,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:19,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:19,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:19,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:25,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:25,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-20 10:01:25,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:25,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:01:25,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:01:25,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:01:25,258 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-20 10:01:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:25,409 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-20 10:01:25,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:01:25,409 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-20 10:01:25,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:25,410 INFO L225 Difference]: With dead ends: 80 [2019-01-20 10:01:25,410 INFO L226 Difference]: Without dead ends: 78 [2019-01-20 10:01:25,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:01:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-20 10:01:25,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-20 10:01:25,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:01:25,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-20 10:01:25,413 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-20 10:01:25,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:25,414 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-20 10:01:25,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:01:25,414 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-20 10:01:25,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-20 10:01:25,414 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:25,414 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-20 10:01:25,414 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:25,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:25,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-20 10:01:25,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:25,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:25,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:25,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:25,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:27,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:27,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:27,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:27,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:27,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:27,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:27,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:27,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:28,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:01:28,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:28,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:28,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:34,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:34,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-20 10:01:34,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:34,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:01:34,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:01:34,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:01:34,207 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-20 10:01:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:34,316 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-20 10:01:34,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:01:34,316 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-20 10:01:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:34,317 INFO L225 Difference]: With dead ends: 81 [2019-01-20 10:01:34,317 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:01:34,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:01:34,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:01:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 10:01:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:01:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-20 10:01:34,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-20 10:01:34,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:34,322 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-20 10:01:34,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:01:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-20 10:01:34,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 10:01:34,322 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:34,322 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-20 10:01:34,323 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:34,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:34,323 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-20 10:01:34,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:34,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:34,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:34,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:36,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:36,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:36,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:36,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:36,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:36,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:36,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:01:36,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:01:36,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:01:36,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:36,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:36,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:36,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:42,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:42,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:42,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-20 10:01:42,902 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:42,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 10:01:42,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 10:01:42,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:01:42,904 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-20 10:01:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:43,017 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-20 10:01:43,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:01:43,017 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-20 10:01:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:43,018 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:01:43,018 INFO L226 Difference]: Without dead ends: 80 [2019-01-20 10:01:43,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:01:43,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-20 10:01:43,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-20 10:01:43,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:01:43,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-20 10:01:43,021 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-20 10:01:43,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:43,021 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-20 10:01:43,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 10:01:43,022 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-20 10:01:43,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-20 10:01:43,022 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:43,022 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-20 10:01:43,022 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:43,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:43,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-20 10:01:43,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:43,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:01:43,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:43,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:45,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:45,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:45,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:45,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:45,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:45,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:45,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:45,406 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:01:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:45,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:45,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:01:51,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:51,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:01:51,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-20 10:01:51,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:01:51,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-20 10:01:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-20 10:01:51,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:01:51,754 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-20 10:01:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:01:52,230 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-20 10:01:52,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:01:52,231 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-20 10:01:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:01:52,231 INFO L225 Difference]: With dead ends: 83 [2019-01-20 10:01:52,231 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:01:52,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:01:52,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:01:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 10:01:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:01:52,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-20 10:01:52,234 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-20 10:01:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:01:52,235 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-20 10:01:52,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-20 10:01:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-20 10:01:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:01:52,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:01:52,236 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-20 10:01:52,236 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:01:52,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:01:52,236 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-20 10:01:52,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:01:52,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:01:52,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:01:52,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:01:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:01:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:54,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:01:54,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:01:54,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:01:54,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:01:54,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:01:54,724 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:01:54,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:01:55,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-20 10:01:55,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:01:55,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:01:55,550 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:01:55,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:02,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:02,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-20 10:02:02,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:02,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:02:02,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:02:02,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:02,064 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-20 10:02:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:02,671 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-20 10:02:02,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:02:02,672 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-20 10:02:02,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:02,672 INFO L225 Difference]: With dead ends: 84 [2019-01-20 10:02:02,673 INFO L226 Difference]: Without dead ends: 82 [2019-01-20 10:02:02,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:02:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-20 10:02:02,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-20 10:02:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-20 10:02:02,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-20 10:02:02,676 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-20 10:02:02,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:02,677 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-20 10:02:02,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:02:02,677 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-20 10:02:02,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-20 10:02:02,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:02,678 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-20 10:02:02,678 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:02,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:02,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-20 10:02:02,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:02,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:02,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:02,679 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:05,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:05,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:05,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:05,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:05,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:05,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:05,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:05,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:05,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:05,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:05,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:05,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:05,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:12,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:12,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-20 10:02:12,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:12,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-20 10:02:12,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-20 10:02:12,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:12,446 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-20 10:02:12,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:12,599 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-20 10:02:12,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:02:12,599 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-20 10:02:12,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:12,599 INFO L225 Difference]: With dead ends: 85 [2019-01-20 10:02:12,600 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:02:12,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:02:12,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:02:12,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 10:02:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:02:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-20 10:02:12,603 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-20 10:02:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:12,603 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-20 10:02:12,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-20 10:02:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-20 10:02:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 10:02:12,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:12,604 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-20 10:02:12,604 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:12,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:12,605 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-20 10:02:12,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:12,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:12,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:12,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:14,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:14,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:14,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:14,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:14,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:14,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:14,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:14,932 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:15,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:15,017 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:15,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:22,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:22,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-20 10:02:22,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:22,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:02:22,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:02:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:22,083 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-20 10:02:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:22,205 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-20 10:02:22,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:02:22,206 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-20 10:02:22,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:22,207 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:02:22,207 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:02:22,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:02:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:02:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-20 10:02:22,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:02:22,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-20 10:02:22,211 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-20 10:02:22,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:22,211 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-20 10:02:22,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:02:22,211 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-20 10:02:22,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-20 10:02:22,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:22,212 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-20 10:02:22,212 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:22,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-20 10:02:22,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:22,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:22,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:22,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:22,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:24,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:24,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:24,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:24,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:24,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:24,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:24,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:24,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:25,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-20 10:02:25,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:25,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:25,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:25,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:33,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:33,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:33,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-20 10:02:33,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:33,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:02:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:02:33,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:02:33,194 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-20 10:02:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:33,383 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-20 10:02:33,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:02:33,384 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-20 10:02:33,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:33,384 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:02:33,384 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:02:33,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:02:33,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:02:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 10:02:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:02:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-20 10:02:33,387 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-20 10:02:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:33,387 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-20 10:02:33,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:02:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-20 10:02:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:02:33,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:33,388 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-20 10:02:33,388 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:33,388 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-20 10:02:33,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:33,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:33,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:33,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:33,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:33,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:35,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:35,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:35,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:35,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:35,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:35,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:35,740 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:35,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:02:35,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:02:35,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:02:35,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:35,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:35,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:35,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:43,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:43,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:43,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-20 10:02:43,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:43,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 10:02:43,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 10:02:43,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:02:43,184 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-20 10:02:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:43,352 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-20 10:02:43,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:02:43,352 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-20 10:02:43,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:43,353 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:02:43,353 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:02:43,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:02:43,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:02:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-20 10:02:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-20 10:02:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-20 10:02:43,356 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-20 10:02:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:43,356 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-20 10:02:43,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 10:02:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-20 10:02:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-20 10:02:43,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:43,357 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-20 10:02:43,357 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:43,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-20 10:02:43,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:43,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:02:43,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:43,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:43,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:45,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:45,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:45,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:45,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:45,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:45,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:45,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:45,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:02:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:46,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:46,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:02:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:53,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:02:53,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-20 10:02:53,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:02:53,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-20 10:02:53,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-20 10:02:53,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:02:53,473 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-20 10:02:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:02:53,708 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-20 10:02:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:02:53,709 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-20 10:02:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:02:53,709 INFO L225 Difference]: With dead ends: 89 [2019-01-20 10:02:53,709 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:02:53,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:02:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:02:53,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 10:02:53,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:02:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-20 10:02:53,712 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-20 10:02:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:02:53,712 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-20 10:02:53,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-20 10:02:53,713 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-20 10:02:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:02:53,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:02:53,713 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-20 10:02:53,713 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:02:53,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:02:53,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-20 10:02:53,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:02:53,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:53,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:02:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:02:53,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:02:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:02:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:56,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:56,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:02:56,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:02:56,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:02:56,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:02:56,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:02:56,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:02:56,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:02:57,296 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-20 10:02:57,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:02:57,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:02:57,314 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:02:57,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:04,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:04,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:04,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-20 10:03:04,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:04,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:03:04,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:03:04,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:03:04,873 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-20 10:03:05,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:05,012 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-20 10:03:05,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:03:05,012 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-20 10:03:05,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:05,013 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:03:05,013 INFO L226 Difference]: Without dead ends: 88 [2019-01-20 10:03:05,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:03:05,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-20 10:03:05,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-20 10:03:05,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-20 10:03:05,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-20 10:03:05,017 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-20 10:03:05,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:05,017 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-20 10:03:05,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:03:05,017 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-20 10:03:05,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-20 10:03:05,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:05,018 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-20 10:03:05,018 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:05,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:05,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-20 10:03:05,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:05,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:05,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:05,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:05,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:05,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:07,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:07,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:07,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:07,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:07,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:07,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:07,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:07,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:07,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:08,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:08,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:08,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:08,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:08,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:15,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-20 10:03:15,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:15,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-20 10:03:15,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-20 10:03:15,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:03:15,694 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-20 10:03:15,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:15,866 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-20 10:03:15,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:03:15,866 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-20 10:03:15,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:15,867 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:03:15,867 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:03:15,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:03:15,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:03:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 10:03:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:03:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-20 10:03:15,872 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-20 10:03:15,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:15,872 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-20 10:03:15,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-20 10:03:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-20 10:03:15,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:03:15,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:15,873 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-20 10:03:15,874 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:15,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:15,874 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-20 10:03:15,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:15,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:15,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:15,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:15,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:18,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:18,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:18,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:18,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:18,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:18,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:18,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:18,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:18,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:18,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:18,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:26,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:26,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-20 10:03:26,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:26,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:03:26,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:03:26,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:03:26,817 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-20 10:03:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:27,048 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-20 10:03:27,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:03:27,049 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-20 10:03:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:27,049 INFO L225 Difference]: With dead ends: 92 [2019-01-20 10:03:27,050 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:03:27,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:03:27,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:03:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-20 10:03:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-20 10:03:27,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-20 10:03:27,052 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-20 10:03:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:27,053 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-20 10:03:27,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:03:27,053 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-20 10:03:27,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-20 10:03:27,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:27,054 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-20 10:03:27,054 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:27,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:27,054 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-20 10:03:27,054 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:27,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:27,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:27,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:27,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:29,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:29,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:29,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:29,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:29,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:29,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:29,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:03:29,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:03:30,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-20 10:03:30,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:30,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:30,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:30,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:39,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:39,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-20 10:03:39,356 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:39,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:03:39,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:03:39,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:03:39,358 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-20 10:03:39,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:39,593 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-20 10:03:39,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:03:39,594 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-20 10:03:39,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:39,594 INFO L225 Difference]: With dead ends: 93 [2019-01-20 10:03:39,594 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:03:39,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:03:39,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:03:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 10:03:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:03:39,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-20 10:03:39,597 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-20 10:03:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:39,598 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-20 10:03:39,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:03:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-20 10:03:39,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 10:03:39,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:39,599 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-20 10:03:39,599 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:39,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:39,599 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-20 10:03:39,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:39,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:39,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:39,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:39,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:42,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:42,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:42,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:42,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:42,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:42,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:42,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:42,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:03:42,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:03:42,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:03:42,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:03:42,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:42,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:03:50,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:50,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:03:50,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-20 10:03:50,969 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:03:50,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:03:50,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:03:50,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:03:50,971 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-20 10:03:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:03:51,104 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-20 10:03:51,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:03:51,104 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-20 10:03:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:03:51,105 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:03:51,105 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:03:51,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:03:51,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:03:51,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-20 10:03:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:03:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-20 10:03:51,108 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-20 10:03:51,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:03:51,108 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-20 10:03:51,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:03:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-20 10:03:51,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-20 10:03:51,109 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:03:51,109 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-20 10:03:51,109 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:03:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:03:51,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-20 10:03:51,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:03:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:51,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:03:51,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:03:51,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:03:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:54,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:54,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:03:54,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:03:54,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:03:54,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:03:54,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:03:54,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:03:54,085 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:03:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:03:54,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:03:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:03:54,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:02,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:02,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-20 10:04:02,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:02,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:04:02,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:04:02,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:02,453 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-20 10:04:02,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:02,676 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-20 10:04:02,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:04:02,676 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-20 10:04:02,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:02,677 INFO L225 Difference]: With dead ends: 95 [2019-01-20 10:04:02,677 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:04:02,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:04:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:04:02,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 10:04:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:04:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-20 10:04:02,680 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-20 10:04:02,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:02,680 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-20 10:04:02,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:04:02,680 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-20 10:04:02,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:04:02,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:02,681 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-20 10:04:02,681 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:02,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:02,681 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-20 10:04:02,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:02,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:02,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:02,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:02,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:05,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:05,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:05,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:05,809 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:05,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:05,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:05,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:05,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:07,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-20 10:04:07,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:07,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:07,180 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:15,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:16,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:16,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-20 10:04:16,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:16,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:04:16,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:04:16,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:16,005 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-20 10:04:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:16,147 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-20 10:04:16,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:04:16,147 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-20 10:04:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:16,148 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:04:16,149 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 10:04:16,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:04:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 10:04:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-20 10:04:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-20 10:04:16,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-20 10:04:16,152 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-20 10:04:16,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:16,152 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-20 10:04:16,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:04:16,153 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-20 10:04:16,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-20 10:04:16,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:16,153 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-20 10:04:16,153 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:16,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:16,153 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-20 10:04:16,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:16,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:16,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:16,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:19,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:19,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:19,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:19,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:19,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:19,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:19,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:19,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:19,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:19,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:19,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:19,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:19,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:28,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:28,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:28,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-20 10:04:28,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:28,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-20 10:04:28,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-20 10:04:28,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:04:28,236 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-20 10:04:28,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:28,521 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-20 10:04:28,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:04:28,521 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-20 10:04:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:28,522 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:04:28,522 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:04:28,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:04:28,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:04:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 10:04:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:04:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-20 10:04:28,525 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-20 10:04:28,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:28,525 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-20 10:04:28,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-20 10:04:28,526 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-20 10:04:28,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 10:04:28,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:28,526 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-20 10:04:28,526 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:28,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:28,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-20 10:04:28,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:28,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:28,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:28,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:28,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:28,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:31,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:31,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:31,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:31,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:31,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:31,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:31,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:31,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:04:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:31,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:31,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:40,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:40,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-20 10:04:40,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:40,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:04:40,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:04:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:04:40,811 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-20 10:04:41,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:41,010 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-20 10:04:41,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:04:41,010 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-20 10:04:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:41,011 INFO L225 Difference]: With dead ends: 98 [2019-01-20 10:04:41,011 INFO L226 Difference]: Without dead ends: 96 [2019-01-20 10:04:41,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:04:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-20 10:04:41,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-20 10:04:41,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-20 10:04:41,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-20 10:04:41,015 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-20 10:04:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:41,015 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-20 10:04:41,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:04:41,015 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-20 10:04:41,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-20 10:04:41,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:41,016 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-20 10:04:41,016 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-20 10:04:41,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:04:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:41,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:44,667 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:44,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:44,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:44,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:44,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:44,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:44,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:44,676 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:04:44,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:04:46,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-20 10:04:46,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:46,114 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:46,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:04:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:55,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:04:55,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-20 10:04:55,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:04:55,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:04:55,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:04:55,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:04:55,314 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-20 10:04:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:04:55,471 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-20 10:04:55,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:04:55,472 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-20 10:04:55,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:04:55,472 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:04:55,472 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:04:55,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:04:55,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:04:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 10:04:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:04:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-20 10:04:55,475 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-20 10:04:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:04:55,476 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-20 10:04:55,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:04:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-20 10:04:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:04:55,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:04:55,476 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-20 10:04:55,476 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:04:55,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:04:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-20 10:04:55,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:04:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:55,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:04:55,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:04:55,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:04:55,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:04:58,708 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:58,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:58,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:04:58,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:04:58,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:04:58,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:04:58,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:04:58,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:04:58,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:04:58,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:04:58,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:04:58,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:04:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:04:58,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:08,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:08,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:08,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-20 10:05:08,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:08,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:05:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:05:08,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:05:08,388 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-20 10:05:08,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:08,532 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-20 10:05:08,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:05:08,533 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-20 10:05:08,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:08,533 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:05:08,533 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:05:08,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:05:08,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:05:08,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-20 10:05:08,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:05:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-20 10:05:08,537 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-20 10:05:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:08,537 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-20 10:05:08,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:05:08,538 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-20 10:05:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-20 10:05:08,538 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:08,538 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-20 10:05:08,538 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:08,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-20 10:05:08,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:08,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:08,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:12,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:12,018 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:12,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:12,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:12,018 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:12,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:12,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:12,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:21,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:21,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-20 10:05:21,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:21,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-20 10:05:21,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-20 10:05:21,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:05:21,817 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-20 10:05:21,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:21,974 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-20 10:05:21,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:05:21,975 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-20 10:05:21,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:21,976 INFO L225 Difference]: With dead ends: 101 [2019-01-20 10:05:21,976 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:05:21,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:05:21,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:05:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 10:05:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 10:05:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-20 10:05:21,979 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-20 10:05:21,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:21,979 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-20 10:05:21,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-20 10:05:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-20 10:05:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 10:05:21,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:21,980 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-20 10:05:21,980 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-20 10:05:21,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:21,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:21,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:21,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:21,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:25,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:25,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:25,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:25,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:25,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:25,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:25,490 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:25,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:27,148 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-20 10:05:27,148 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:27,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:27,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:27,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:37,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:37,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-20 10:05:37,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:37,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:05:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:05:37,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:05:37,104 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-20 10:05:37,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:37,271 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-20 10:05:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:05:37,272 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-20 10:05:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:37,272 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:05:37,272 INFO L226 Difference]: Without dead ends: 100 [2019-01-20 10:05:37,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:05:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-20 10:05:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-20 10:05:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:05:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-20 10:05:37,276 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-20 10:05:37,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:37,276 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-20 10:05:37,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:05:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-20 10:05:37,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-20 10:05:37,277 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:37,277 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-20 10:05:37,278 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:37,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:37,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-20 10:05:37,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:37,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:37,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:37,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:37,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:37,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:40,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:40,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:40,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:40,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:40,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:40,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:40,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:40,858 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:40,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:40,942 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:40,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:40,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:40,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:51,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:51,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-20 10:05:51,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:51,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-20 10:05:51,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-20 10:05:51,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:05:51,126 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-20 10:05:51,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:51,356 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-20 10:05:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:05:51,356 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-20 10:05:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:51,357 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:05:51,357 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:05:51,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:05:51,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:05:51,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 10:05:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:05:51,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-20 10:05:51,361 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-20 10:05:51,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:51,361 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-20 10:05:51,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-20 10:05:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-20 10:05:51,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:05:51,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:51,362 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-20 10:05:51,362 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:51,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:51,362 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-20 10:05:51,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:51,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:51,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:51,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:54,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:54,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:54,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:54,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:54,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:54,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:54,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:54,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:54,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:54,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:54,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:05,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:05,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-20 10:06:05,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:05,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:06:05,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:06:05,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:06:05,079 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-20 10:06:05,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:05,384 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-20 10:06:05,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:06:05,385 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-20 10:06:05,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:05,385 INFO L225 Difference]: With dead ends: 104 [2019-01-20 10:06:05,386 INFO L226 Difference]: Without dead ends: 102 [2019-01-20 10:06:05,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:06:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-20 10:06:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-20 10:06:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:06:05,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-20 10:06:05,390 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-20 10:06:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:05,390 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-20 10:06:05,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:06:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-20 10:06:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-20 10:06:05,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:05,391 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-20 10:06:05,391 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:05,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:05,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-20 10:06:05,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:05,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:09,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:09,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:09,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:09,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:09,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:09,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:09,101 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:09,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:09,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:10,923 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-20 10:06:10,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:10,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:10,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:21,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:21,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-20 10:06:21,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:21,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:06:21,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:06:21,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:06:21,457 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-20 10:06:21,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:21,690 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-20 10:06:21,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:06:21,691 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-20 10:06:21,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:21,691 INFO L225 Difference]: With dead ends: 105 [2019-01-20 10:06:21,691 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:06:21,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:06:21,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:06:21,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 10:06:21,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:06:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-20 10:06:21,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-20 10:06:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:21,696 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-20 10:06:21,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:06:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-20 10:06:21,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 10:06:21,697 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:21,697 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-20 10:06:21,697 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:21,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:21,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-20 10:06:21,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:21,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:21,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:21,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:21,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:25,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:25,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:25,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:25,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:25,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:25,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:25,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:25,233 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:25,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:25,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:25,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:25,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:25,344 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:35,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:35,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-20 10:06:35,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:35,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:06:35,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:06:35,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:06:35,956 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-20 10:06:36,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:36,241 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-20 10:06:36,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-20 10:06:36,242 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-20 10:06:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:36,242 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:06:36,242 INFO L226 Difference]: Without dead ends: 104 [2019-01-20 10:06:36,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:06:36,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-20 10:06:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-20 10:06:36,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-20 10:06:36,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-20 10:06:36,246 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-20 10:06:36,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:36,246 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-20 10:06:36,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:06:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-20 10:06:36,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-20 10:06:36,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:36,247 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-20 10:06:36,247 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:36,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:36,248 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-20 10:06:36,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:36,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:36,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:36,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:36,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:40,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:40,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:40,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:40,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:40,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:40,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:40,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:40,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:40,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:40,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:40,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:51,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:51,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-20 10:06:51,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:51,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-20 10:06:51,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-20 10:06:51,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:06:51,122 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-20 10:06:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:51,307 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-20 10:06:51,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:06:51,308 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-20 10:06:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:51,309 INFO L225 Difference]: With dead ends: 107 [2019-01-20 10:06:51,309 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:06:51,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:06:51,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:06:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 10:06:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:06:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-20 10:06:51,314 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-20 10:06:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:51,314 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-20 10:06:51,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-20 10:06:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-20 10:06:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:06:51,315 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:51,315 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-20 10:06:51,316 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:51,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-20 10:06:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:51,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:51,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:51,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:55,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:55,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:55,144 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:55,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:55,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:55,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:55,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:55,153 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:57,248 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-20 10:06:57,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:57,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:57,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:57,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:08,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:08,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-20 10:07:08,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:08,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:07:08,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:07:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:07:08,517 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-20 10:07:08,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:08,833 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-20 10:07:08,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:07:08,833 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-20 10:07:08,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:08,834 INFO L225 Difference]: With dead ends: 108 [2019-01-20 10:07:08,834 INFO L226 Difference]: Without dead ends: 106 [2019-01-20 10:07:08,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:07:08,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-20 10:07:08,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-20 10:07:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-20 10:07:08,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-20 10:07:08,839 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-20 10:07:08,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:08,839 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-20 10:07:08,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:07:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-20 10:07:08,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-20 10:07:08,840 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:08,840 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-20 10:07:08,840 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:08,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-20 10:07:08,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:08,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:08,842 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:12,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:12,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:12,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:12,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:12,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:12,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:12,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:12,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:12,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:12,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:12,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:12,936 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:12,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:24,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:24,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:24,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-20 10:07:24,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:24,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:07:24,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:07:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:07:24,367 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-20 10:07:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:24,659 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-20 10:07:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:07:24,660 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-20 10:07:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:24,660 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:07:24,660 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:07:24,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:07:24,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:07:24,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 10:07:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:07:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-20 10:07:24,664 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-20 10:07:24,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:24,664 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-20 10:07:24,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:07:24,664 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-20 10:07:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 10:07:24,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:24,665 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-20 10:07:24,665 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:24,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-20 10:07:24,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:24,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:24,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:24,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:24,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:24,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:28,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:28,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:28,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:28,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:28,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:28,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:28,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:28,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:28,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:28,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:40,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:40,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:40,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-20 10:07:40,841 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:40,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:07:40,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:07:40,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:07:40,844 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-20 10:07:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:41,082 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-20 10:07:41,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-20 10:07:41,089 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-20 10:07:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:41,090 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:07:41,090 INFO L226 Difference]: Without dead ends: 108 [2019-01-20 10:07:41,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:07:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-20 10:07:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-20 10:07:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:07:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-20 10:07:41,095 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-20 10:07:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:41,095 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-20 10:07:41,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:07:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-20 10:07:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-20 10:07:41,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:41,096 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-20 10:07:41,096 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:41,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:41,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-20 10:07:41,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:41,097 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:41,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:45,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:45,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:45,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:45,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:45,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:45,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:45,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:45,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:47,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-20 10:07:47,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:47,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:47,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:59,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:59,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:59,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-20 10:07:59,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:59,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:07:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:07:59,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:07:59,445 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-20 10:07:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:59,661 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-20 10:07:59,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-20 10:07:59,663 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-20 10:07:59,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:59,663 INFO L225 Difference]: With dead ends: 111 [2019-01-20 10:07:59,663 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:07:59,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:07:59,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:07:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-20 10:07:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 10:07:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-20 10:07:59,667 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-20 10:07:59,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-20 10:07:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:07:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-20 10:07:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 10:07:59,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:59,668 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-20 10:07:59,668 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-20 10:07:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:59,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:59,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:03,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:03,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:03,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:03,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:03,746 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:03,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:03,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:03,754 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:03,755 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:03,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:03,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:03,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:03,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:03,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:15,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:15,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-20 10:08:15,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:15,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-20 10:08:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-20 10:08:15,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:08:15,970 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-20 10:08:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:16,205 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-20 10:08:16,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-20 10:08:16,205 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-20 10:08:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:16,206 INFO L225 Difference]: With dead ends: 112 [2019-01-20 10:08:16,206 INFO L226 Difference]: Without dead ends: 110 [2019-01-20 10:08:16,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-20 10:08:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-20 10:08:16,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-20 10:08:16,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-20 10:08:16,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-20 10:08:16,209 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-20 10:08:16,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:16,209 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-20 10:08:16,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-20 10:08:16,209 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-20 10:08:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-20 10:08:16,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:16,210 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-20 10:08:16,210 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-20 10:08:16,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:16,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:16,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:16,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:16,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:20,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:20,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:20,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:20,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:20,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:20,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:20,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:20,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:20,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:20,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:32,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:32,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:32,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-20 10:08:32,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:32,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-20 10:08:32,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-20 10:08:32,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:08:32,674 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-20 10:08:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:32,960 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-20 10:08:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-20 10:08:32,961 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-20 10:08:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:32,961 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:08:32,961 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:08:32,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-20 10:08:32,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:08:32,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-20 10:08:32,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:08:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-20 10:08:32,966 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-20 10:08:32,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:32,966 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-20 10:08:32,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-20 10:08:32,966 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-20 10:08:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 10:08:32,967 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:32,967 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-20 10:08:32,967 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-20 10:08:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:32,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:37,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:37,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:37,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:37,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:37,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:37,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:37,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:37,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:37,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:40,062 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-20 10:08:40,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:40,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:40,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:40,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:52,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:52,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-20 10:08:52,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:52,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-20 10:08:52,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-20 10:08:52,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:08:52,327 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-20 10:08:52,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:52,658 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-20 10:08:52,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-20 10:08:52,658 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-20 10:08:52,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:52,659 INFO L225 Difference]: With dead ends: 114 [2019-01-20 10:08:52,659 INFO L226 Difference]: Without dead ends: 112 [2019-01-20 10:08:52,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-20 10:08:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-20 10:08:52,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-20 10:08:52,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-20 10:08:52,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-20 10:08:52,662 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-20 10:08:52,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:52,663 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-20 10:08:52,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-20 10:08:52,663 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-20 10:08:52,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-20 10:08:52,663 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:52,663 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-20 10:08:52,663 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:52,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:52,664 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-20 10:08:52,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:52,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:52,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:52,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:52,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:56,955 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:56,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:56,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:56,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:56,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:56,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:56,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:56,964 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:56,964 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:57,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:57,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:57,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:57,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:09,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:09,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:09,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-20 10:09:09,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:09,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-20 10:09:09,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-20 10:09:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-20 10:09:09,739 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-20 10:09:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:09,983 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-20 10:09:09,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-20 10:09:09,984 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-20 10:09:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:09,985 INFO L225 Difference]: With dead ends: 115 [2019-01-20 10:09:09,985 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:09:09,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-20 10:09:09,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:09:09,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-20 10:09:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 10:09:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-20 10:09:09,990 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-20 10:09:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:09,990 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-20 10:09:09,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-20 10:09:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-20 10:09:09,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-20 10:09:09,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:09,991 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-20 10:09:09,991 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:09,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-20 10:09:09,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:09,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:09,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:09,992 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:14,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:14,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:14,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:14,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:14,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:14,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:14,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:14,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:14,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:27,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:27,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:27,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-20 10:09:27,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:27,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-20 10:09:27,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-20 10:09:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-20 10:09:27,604 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-20 10:09:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:27,825 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-20 10:09:27,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-20 10:09:27,825 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-20 10:09:27,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:27,826 INFO L225 Difference]: With dead ends: 116 [2019-01-20 10:09:27,826 INFO L226 Difference]: Without dead ends: 114 [2019-01-20 10:09:27,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-20 10:09:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-20 10:09:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-20 10:09:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-20 10:09:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-20 10:09:27,831 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-20 10:09:27,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:27,831 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-20 10:09:27,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-20 10:09:27,831 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-20 10:09:27,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-20 10:09:27,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:27,832 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-20 10:09:27,832 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:27,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-20 10:09:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:27,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:27,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:32,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:32,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:32,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:32,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:32,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:32,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:32,384 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:32,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:35,245 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-20 10:09:35,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:35,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:35,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:35,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:48,611 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:48,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:48,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-20 10:09:48,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:48,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-20 10:09:48,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-20 10:09:48,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-20 10:09:48,636 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-20 10:09:49,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:49,017 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-20 10:09:49,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-20 10:09:49,018 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-20 10:09:49,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:49,018 INFO L225 Difference]: With dead ends: 117 [2019-01-20 10:09:49,018 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 10:09:49,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-20 10:09:49,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 10:09:49,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-20 10:09:49,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-20 10:09:49,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-20 10:09:49,023 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-20 10:09:49,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:49,023 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-20 10:09:49,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-20 10:09:49,023 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-20 10:09:49,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-20 10:09:49,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:49,024 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-20 10:09:49,024 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:49,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:49,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-20 10:09:49,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:49,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:49,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:49,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:49,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:53,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:53,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:53,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:53,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:53,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:53,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:53,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:53,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:53,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:53,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:53,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:53,763 INFO L316 TraceCheckSpWp]: Computing backward predicates...