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-e1a14da [2018-12-24 13:46:56,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:46:56,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:46:56,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:46:56,827 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:46:56,829 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:46:56,830 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:46:56,833 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:46:56,836 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:46:56,838 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:46:56,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:46:56,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:46:56,846 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:46:56,847 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:46:56,849 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:46:56,849 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:46:56,850 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:46:56,853 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:46:56,855 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:46:56,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:46:56,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:46:56,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:46:56,872 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:46:56,872 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:46:56,873 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:46:56,875 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:46:56,878 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:46:56,880 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:46:56,881 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:46:56,884 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:46:56,884 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:46:56,885 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:46:56,885 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:46:56,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:46:56,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:46:56,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:46:56,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:46:56,911 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:46:56,911 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:46:56,912 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:46:56,913 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:46:56,913 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:46:56,913 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:46:56,913 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:46:56,913 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:46:56,917 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:46:56,917 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:46:56,917 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:46:56,917 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:46:56,918 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:46:56,918 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:46:56,919 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:46:56,919 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:46:56,919 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:46:56,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:46:56,921 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:46:56,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:46:56,922 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:46:56,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:46:56,922 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:46:56,922 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:46:56,923 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:46:56,923 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:46:56,923 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:46:56,924 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:46:56,924 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:46:56,924 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:46:56,924 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:46:56,924 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:46:56,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:46:56,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:46:56,925 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:46:56,925 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:46:56,926 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:46:56,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:46:56,926 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:46:56,927 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:46:56,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:46:56,993 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:46:56,999 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:46:57,000 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:46:57,001 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:46:57,002 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 [2018-12-24 13:46:57,002 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2018-12-24 13:46:57,050 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:46:57,052 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:46:57,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:46:57,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:46:57,054 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:46:57,074 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 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,088 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 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,097 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:46:57,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:46:57,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:46:57,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:46:57,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,115 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,120 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,121 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:46:57,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:46:57,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:46:57,124 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:46:57,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:46:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:46:57,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:46:57,410 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:46:57,411 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-24 13:46:57,411 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:57 BoogieIcfgContainer [2018-12-24 13:46:57,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:46:57,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:46:57,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:46:57,416 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:46:57,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/2) ... [2018-12-24 13:46:57,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ba9517c and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:46:57, skipping insertion in model container [2018-12-24 13:46:57,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:57" (2/2) ... [2018-12-24 13:46:57,420 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2018-12-24 13:46:57,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:46:57,438 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 13:46:57,457 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 13:46:57,495 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:46:57,495 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:46:57,495 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:46:57,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:46:57,496 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:46:57,496 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:46:57,496 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:46:57,496 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:46:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-24 13:46:57,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:46:57,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:57,520 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:46:57,522 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:57,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:57,529 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-24 13:46:57,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:57,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:57,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:57,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:46:57,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:46:57,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:46:57,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:46:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:46:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:46:57,696 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-24 13:46:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:57,755 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-24 13:46:57,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:46:57,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:46:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:57,770 INFO L225 Difference]: With dead ends: 9 [2018-12-24 13:46:57,770 INFO L226 Difference]: Without dead ends: 5 [2018-12-24 13:46:57,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:46:57,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-24 13:46:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-24 13:46:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-24 13:46:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-24 13:46:57,810 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-24 13:46:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:57,811 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-24 13:46:57,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:46:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-24 13:46:57,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:46:57,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:57,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:46:57,812 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:57,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:57,812 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-24 13:46:57,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:57,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:57,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:57,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:57,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:57,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:57,976 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-24 13:46:57,978 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-24 13:46:58,030 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:46:58,030 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:46:58,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:46:58,165 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. [2018-12-24 13:46:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:46:58,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,179 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 [2018-12-24 13:46:58,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:58,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:46:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:58,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-24 13:46:58,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:46:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:46:58,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:46:58,333 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-24 13:46:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:58,361 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-24 13:46:58,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:46:58,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-24 13:46:58,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:58,362 INFO L225 Difference]: With dead ends: 8 [2018-12-24 13:46:58,362 INFO L226 Difference]: Without dead ends: 6 [2018-12-24 13:46:58,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:46:58,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-24 13:46:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-24 13:46:58,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-24 13:46:58,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-24 13:46:58,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-24 13:46:58,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:58,366 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-24 13:46:58,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:46:58,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-24 13:46:58,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-24 13:46:58,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:58,367 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-24 13:46:58,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,368 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-24 13:46:58,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:58,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:58,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:58,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:58,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,434 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 [2018-12-24 13:46:58,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:46:58,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:46:58,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:46:58,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:46:58,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:58,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,467 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:58,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-24 13:46:58,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:58,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 13:46:58,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 13:46:58,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:46:58,604 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-24 13:46:58,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:58,667 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-24 13:46:58,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:46:58,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-24 13:46:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:58,668 INFO L225 Difference]: With dead ends: 9 [2018-12-24 13:46:58,668 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 13:46:58,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:46:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 13:46:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 13:46:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 13:46:58,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-24 13:46:58,671 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-24 13:46:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:58,672 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-24 13:46:58,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 13:46:58,672 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-24 13:46:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:46:58,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:58,673 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-24 13:46:58,673 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:58,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,674 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-24 13:46:58,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:46:58,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:58,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:58,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:58,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,840 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 [2018-12-24 13:46:58,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:46:58,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:46:58,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:46:58,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:46:58,907 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:58,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:59,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:59,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-24 13:46:59,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:59,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:46:59,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:46:59,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:46:59,196 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-24 13:46:59,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:59,217 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-24 13:46:59,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:46:59,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-24 13:46:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:59,219 INFO L225 Difference]: With dead ends: 10 [2018-12-24 13:46:59,219 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 13:46:59,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:46:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 13:46:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-24 13:46:59,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-24 13:46:59,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-24 13:46:59,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-24 13:46:59,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:59,223 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-24 13:46:59,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:46:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-24 13:46:59,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-24 13:46:59,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:59,225 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-24 13:46:59,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:59,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-24 13:46:59,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:59,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:46:59,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:59,429 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:59,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:59,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:59,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,431 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 [2018-12-24 13:46:59,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:59,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:46:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:59,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:59,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:59,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-24 13:46:59,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:59,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:46:59,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:46:59,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:46:59,620 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-24 13:46:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:59,652 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-24 13:46:59,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:46:59,653 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-24 13:46:59,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:59,653 INFO L225 Difference]: With dead ends: 11 [2018-12-24 13:46:59,654 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:46:59,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:46:59,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:46:59,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 13:46:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:46:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-24 13:46:59,657 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-24 13:46:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:59,657 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-24 13:46:59,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:46:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-24 13:46:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:46:59,658 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:59,658 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-24 13:46:59,659 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:59,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:59,659 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-24 13:46:59,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:59,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:59,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,661 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:59,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:59,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:59,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,769 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 [2018-12-24 13:46:59,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:46:59,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:46:59,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:46:59,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:46:59,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:59,869 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:59,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:00,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:00,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-24 13:47:00,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:00,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:47:00,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:47:00,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:00,294 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-24 13:47:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:00,338 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-24 13:47:00,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:47:00,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-24 13:47:00,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:00,341 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:47:00,341 INFO L226 Difference]: Without dead ends: 10 [2018-12-24 13:47:00,342 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 [2018-12-24 13:47:00,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-24 13:47:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-24 13:47:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 13:47:00,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-24 13:47:00,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-24 13:47:00,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:00,345 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-24 13:47:00,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:47:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-24 13:47:00,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:47:00,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:00,346 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-24 13:47:00,346 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:00,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:00,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-24 13:47:00,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:00,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:00,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:00,458 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:00,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:00,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:00,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,459 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 [2018-12-24 13:47:00,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:00,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:00,478 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:00,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:00,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:00,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-24 13:47:00,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:00,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:47:00,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:47:00,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:47:00,649 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-24 13:47:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:00,722 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-24 13:47:00,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:47:00,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-24 13:47:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:00,723 INFO L225 Difference]: With dead ends: 13 [2018-12-24 13:47:00,723 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 13:47:00,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:47:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 13:47:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 13:47:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 13:47:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-24 13:47:00,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-24 13:47:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:00,727 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-24 13:47:00,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:47:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-24 13:47:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 13:47:00,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:00,728 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-24 13:47:00,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:00,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-24 13:47:00,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:00,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:00,885 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:00,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:00,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:00,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,887 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 [2018-12-24 13:47:00,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:00,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:00,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:00,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:01,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:01,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-24 13:47:01,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:01,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:47:01,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:47:01,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:47:01,219 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-24 13:47:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:01,248 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-24 13:47:01,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:47:01,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-24 13:47:01,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:01,253 INFO L225 Difference]: With dead ends: 14 [2018-12-24 13:47:01,253 INFO L226 Difference]: Without dead ends: 12 [2018-12-24 13:47:01,254 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 [2018-12-24 13:47:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-24 13:47:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-24 13:47:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-24 13:47:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-24 13:47:01,257 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-24 13:47:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:01,257 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-24 13:47:01,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:47:01,258 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-24 13:47:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-24 13:47:01,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:01,258 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-24 13:47:01,258 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:01,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:01,259 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-24 13:47:01,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:01,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:01,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:01,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:01,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:01,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:01,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,392 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 [2018-12-24 13:47:01,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:01,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:01,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-24 13:47:01,436 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:01,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:01,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:01,668 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-24 13:47:01,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:01,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:47:01,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:47:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:01,689 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-24 13:47:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:01,721 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-24 13:47:01,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:47:01,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-24 13:47:01,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:01,722 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:47:01,722 INFO L226 Difference]: Without dead ends: 13 [2018-12-24 13:47:01,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-24 13:47:01,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-24 13:47:01,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:47:01,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-24 13:47:01,726 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-24 13:47:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:01,726 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-24 13:47:01,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:47:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-24 13:47:01,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 13:47:01,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:01,727 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-24 13:47:01,727 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:01,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:01,728 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-24 13:47:01,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:01,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:01,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:01,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:01,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:01,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,999 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 [2018-12-24 13:47:02,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:02,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:02,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:02,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:02,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:02,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-24 13:47:02,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:02,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:47:02,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:47:02,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:02,307 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-24 13:47:02,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:02,376 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-24 13:47:02,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 13:47:02,376 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-24 13:47:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:02,377 INFO L225 Difference]: With dead ends: 16 [2018-12-24 13:47:02,378 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:47:02,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:02,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:47:02,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-24 13:47:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-24 13:47:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-24 13:47:02,382 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-24 13:47:02,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:02,383 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-24 13:47:02,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:47:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-24 13:47:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-24 13:47:02,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:02,384 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-24 13:47:02,384 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:02,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-24 13:47:02,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:02,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:02,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:02,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:02,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:02,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:02,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:02,552 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 [2018-12-24 13:47:02,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:02,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:02,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:02,598 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:02,856 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:02,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:02,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-24 13:47:02,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:02,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:47:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:47:02,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 13:47:02,878 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-24 13:47:02,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:02,946 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-24 13:47:02,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 13:47:02,947 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-24 13:47:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:02,947 INFO L225 Difference]: With dead ends: 17 [2018-12-24 13:47:02,947 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 13:47:02,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 13:47:02,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 13:47:02,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-24 13:47:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 13:47:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-24 13:47:02,952 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-24 13:47:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:02,952 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-24 13:47:02,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:47:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-24 13:47:02,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-24 13:47:02,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:02,953 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-24 13:47:02,953 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:02,954 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-24 13:47:02,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:02,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:02,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:02,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:03,246 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:03,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:03,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,263 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 [2018-12-24 13:47:03,283 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:03,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:03,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-24 13:47:03,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:03,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:03,824 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:03,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:03,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-24 13:47:03,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:03,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:47:03,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:47:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:03,848 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-24 13:47:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:03,873 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-24 13:47:03,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 13:47:03,881 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-24 13:47:03,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:03,881 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:47:03,881 INFO L226 Difference]: Without dead ends: 16 [2018-12-24 13:47:03,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:03,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-24 13:47:03,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-24 13:47:03,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 13:47:03,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-24 13:47:03,884 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-24 13:47:03,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:03,885 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-24 13:47:03,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:47:03,885 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-24 13:47:03,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-24 13:47:03,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:03,886 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-24 13:47:03,886 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:03,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:03,886 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-24 13:47:03,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:03,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:03,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:04,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:04,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:04,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:04,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:04,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:04,135 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 [2018-12-24 13:47:04,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:04,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:04,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:04,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:04,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:04,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:04,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:04,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-24 13:47:04,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:04,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-24 13:47:04,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-24 13:47:04,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 13:47:04,861 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-24 13:47:04,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:04,937 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-24 13:47:04,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 13:47:04,940 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-24 13:47:04,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:04,941 INFO L225 Difference]: With dead ends: 19 [2018-12-24 13:47:04,941 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:47:04,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 13:47:04,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:47:04,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-24 13:47:04,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:47:04,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-24 13:47:04,945 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-24 13:47:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:04,945 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-24 13:47:04,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-24 13:47:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-24 13:47:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 13:47:04,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:04,946 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-24 13:47:04,946 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-24 13:47:04,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:04,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:04,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:05,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:05,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:05,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,356 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 [2018-12-24 13:47:05,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:05,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:05,403 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:05,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-24 13:47:05,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:05,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 13:47:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 13:47:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 13:47:05,754 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-24 13:47:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:05,785 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-24 13:47:05,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 13:47:05,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-24 13:47:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:05,790 INFO L225 Difference]: With dead ends: 20 [2018-12-24 13:47:05,790 INFO L226 Difference]: Without dead ends: 18 [2018-12-24 13:47:05,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 13:47:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-24 13:47:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-24 13:47:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-24 13:47:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-24 13:47:05,793 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-24 13:47:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:05,794 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-24 13:47:05,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 13:47:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-24 13:47:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-24 13:47:05,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:05,794 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-24 13:47:05,795 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-24 13:47:05,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:05,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:05,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:05,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:05,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,990 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:05,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:05,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:05,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:05,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,991 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 [2018-12-24 13:47:06,004 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:06,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:06,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-24 13:47:06,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:06,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:06,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:06,467 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:06,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:06,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-24 13:47:06,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:06,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-24 13:47:06,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-24 13:47:06,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:06,487 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-24 13:47:06,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:06,575 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-24 13:47:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 13:47:06,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-24 13:47:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:06,577 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:47:06,577 INFO L226 Difference]: Without dead ends: 19 [2018-12-24 13:47:06,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-24 13:47:06,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-24 13:47:06,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 13:47:06,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-24 13:47:06,581 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-24 13:47:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:06,582 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-24 13:47:06,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-24 13:47:06,582 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-24 13:47:06,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 13:47:06,582 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:06,582 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-24 13:47:06,583 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:06,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:06,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-24 13:47:06,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:06,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:06,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:06,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:06,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:06,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:06,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:06,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:06,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:06,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:06,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:06,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:06,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:06,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:06,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:06,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:06,875 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:06,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:07,581 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:07,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:07,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-24 13:47:07,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:07,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 13:47:07,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 13:47:07,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 13:47:07,604 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-24 13:47:07,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:07,795 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-24 13:47:07,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 13:47:07,795 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-24 13:47:07,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:07,796 INFO L225 Difference]: With dead ends: 22 [2018-12-24 13:47:07,796 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:47:07,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 13:47:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:47:07,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-24 13:47:07,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-24 13:47:07,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-24 13:47:07,800 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-24 13:47:07,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:07,800 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-24 13:47:07,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 13:47:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-24 13:47:07,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-24 13:47:07,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:07,801 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-24 13:47:07,801 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:07,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:07,802 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-24 13:47:07,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:07,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:07,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:07,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:07,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:08,543 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:08,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:08,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:08,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:08,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:08,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:08,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:08,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:08,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:08,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:08,592 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:08,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:09,604 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:09,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:09,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-24 13:47:09,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:09,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-24 13:47:09,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-24 13:47:09,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 13:47:09,625 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-24 13:47:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:09,692 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-24 13:47:09,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 13:47:09,694 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-24 13:47:09,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:09,695 INFO L225 Difference]: With dead ends: 23 [2018-12-24 13:47:09,695 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 13:47:09,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 13:47:09,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 13:47:09,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-24 13:47:09,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 13:47:09,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-24 13:47:09,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-24 13:47:09,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:09,700 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-24 13:47:09,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-24 13:47:09,700 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-24 13:47:09,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 13:47:09,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:09,701 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-24 13:47:09,701 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-24 13:47:09,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:09,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:09,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:09,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:09,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:09,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:09,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:09,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:09,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:09,976 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 [2018-12-24 13:47:09,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:09,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:10,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-24 13:47:10,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:10,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:10,025 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:11,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:11,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-24 13:47:11,132 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:11,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 13:47:11,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 13:47:11,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:11,133 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-24 13:47:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:11,163 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-24 13:47:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 13:47:11,163 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-24 13:47:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:11,164 INFO L225 Difference]: With dead ends: 24 [2018-12-24 13:47:11,164 INFO L226 Difference]: Without dead ends: 22 [2018-12-24 13:47:11,165 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 [2018-12-24 13:47:11,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-24 13:47:11,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-24 13:47:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 13:47:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-24 13:47:11,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-24 13:47:11,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:11,169 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-24 13:47:11,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 13:47:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-24 13:47:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-24 13:47:11,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:11,170 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-24 13:47:11,171 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:11,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-24 13:47:11,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:11,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:11,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:11,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:11,993 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:11,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:11,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:11,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:11,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:11,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:11,995 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 [2018-12-24 13:47:12,014 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:12,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:12,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:12,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:12,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:12,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:12,531 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:12,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:12,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-24 13:47:12,551 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:12,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-24 13:47:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-24 13:47:12,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 13:47:12,553 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-24 13:47:12,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:12,592 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-24 13:47:12,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 13:47:12,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-24 13:47:12,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:12,594 INFO L225 Difference]: With dead ends: 25 [2018-12-24 13:47:12,594 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 13:47:12,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 13:47:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 13:47:12,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-24 13:47:12,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:47:12,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-24 13:47:12,599 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-24 13:47:12,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:12,599 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-24 13:47:12,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-24 13:47:12,599 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-24 13:47:12,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-24 13:47:12,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:12,600 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-24 13:47:12,600 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:12,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:12,600 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-24 13:47:12,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:12,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:12,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:12,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:12,602 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:12,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:12,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:12,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:12,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:12,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:12,846 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 [2018-12-24 13:47:12,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:12,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:12,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:12,899 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:13,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:13,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-24 13:47:13,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:13,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 13:47:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 13:47:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 13:47:13,472 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-24 13:47:13,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:13,542 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-24 13:47:13,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 13:47:13,545 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-24 13:47:13,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:13,546 INFO L225 Difference]: With dead ends: 26 [2018-12-24 13:47:13,546 INFO L226 Difference]: Without dead ends: 24 [2018-12-24 13:47:13,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 13:47:13,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-24 13:47:13,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-24 13:47:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-24 13:47:13,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-24 13:47:13,550 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-24 13:47:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:13,550 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-24 13:47:13,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 13:47:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-24 13:47:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-24 13:47:13,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:13,551 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-24 13:47:13,551 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:13,551 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-24 13:47:13,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:13,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:13,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:13,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,558 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:14,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:14,558 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:14,558 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:14,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,559 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 [2018-12-24 13:47:14,566 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:14,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:14,599 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-24 13:47:14,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:14,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:14,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:15,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-24 13:47:15,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:15,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-24 13:47:15,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-24 13:47:15,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:15,336 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-24 13:47:15,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:15,376 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-24 13:47:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 13:47:15,377 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-24 13:47:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:15,378 INFO L225 Difference]: With dead ends: 27 [2018-12-24 13:47:15,378 INFO L226 Difference]: Without dead ends: 25 [2018-12-24 13:47:15,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:15,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-24 13:47:15,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-24 13:47:15,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 13:47:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-24 13:47:15,382 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-24 13:47:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-24 13:47:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-24 13:47:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-24 13:47:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 13:47:15,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:15,384 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-24 13:47:15,384 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:15,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:15,384 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-24 13:47:15,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:15,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:15,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:15,663 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:15,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:15,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,663 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 [2018-12-24 13:47:15,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:15,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:15,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:15,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:15,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:16,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-24 13:47:16,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:16,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 13:47:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 13:47:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:16,314 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-24 13:47:16,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:16,374 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-24 13:47:16,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 13:47:16,377 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-24 13:47:16,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:16,378 INFO L225 Difference]: With dead ends: 28 [2018-12-24 13:47:16,378 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 13:47:16,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 13:47:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-24 13:47:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-24 13:47:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-24 13:47:16,382 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-24 13:47:16,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:16,382 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-24 13:47:16,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 13:47:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-24 13:47:16,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-24 13:47:16,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:16,383 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-24 13:47:16,384 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-24 13:47:16,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:16,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:16,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:16,708 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:16,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:16,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,709 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 [2018-12-24 13:47:16,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:16,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:16,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:17,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-24 13:47:17,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:17,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-24 13:47:17,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-24 13:47:17,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 13:47:17,849 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-24 13:47:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:17,928 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-24 13:47:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 13:47:17,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-24 13:47:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:17,930 INFO L225 Difference]: With dead ends: 29 [2018-12-24 13:47:17,930 INFO L226 Difference]: Without dead ends: 27 [2018-12-24 13:47:17,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 13:47:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-24 13:47:17,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-24 13:47:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-24 13:47:17,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-24 13:47:17,934 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-24 13:47:17,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:17,934 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-24 13:47:17,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-24 13:47:17,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-24 13:47:17,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-24 13:47:17,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:17,935 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-24 13:47:17,935 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-24 13:47:17,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:17,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:17,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:18,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:18,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:18,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,271 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 [2018-12-24 13:47:18,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:18,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:18,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-24 13:47:18,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:18,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:19,104 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:19,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-24 13:47:19,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:19,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 13:47:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 13:47:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:19,124 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-24 13:47:19,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:19,178 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-24 13:47:19,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 13:47:19,179 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-24 13:47:19,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:19,180 INFO L225 Difference]: With dead ends: 30 [2018-12-24 13:47:19,180 INFO L226 Difference]: Without dead ends: 28 [2018-12-24 13:47:19,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-24 13:47:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-24 13:47:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 13:47:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-24 13:47:19,185 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-24 13:47:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:19,186 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-24 13:47:19,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 13:47:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-24 13:47:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-24 13:47:19,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:19,187 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-24 13:47:19,187 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:19,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-24 13:47:19,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:20,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:20,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:20,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,537 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 [2018-12-24 13:47:20,545 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:20,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:20,571 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:20,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:20,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:20,580 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:21,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-24 13:47:21,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:21,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-24 13:47:21,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-24 13:47:21,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 13:47:21,308 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-24 13:47:21,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:21,366 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-24 13:47:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 13:47:21,367 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-24 13:47:21,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:21,367 INFO L225 Difference]: With dead ends: 31 [2018-12-24 13:47:21,367 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 13:47:21,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 13:47:21,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 13:47:21,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-24 13:47:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 13:47:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-24 13:47:21,373 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-24 13:47:21,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:21,373 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-24 13:47:21,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-24 13:47:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-24 13:47:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 13:47:21,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:21,374 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-24 13:47:21,374 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:21,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:21,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-24 13:47:21,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:21,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:21,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:21,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:21,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:21,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:21,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:21,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:21,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:21,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:21,853 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:23,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-24 13:47:23,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:23,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 13:47:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 13:47:23,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 13:47:23,897 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-24 13:47:24,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:24,021 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-24 13:47:24,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 13:47:24,022 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-24 13:47:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:24,023 INFO L225 Difference]: With dead ends: 32 [2018-12-24 13:47:24,023 INFO L226 Difference]: Without dead ends: 30 [2018-12-24 13:47:24,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 13:47:24,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-24 13:47:24,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-24 13:47:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-24 13:47:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-24 13:47:24,026 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-24 13:47:24,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:24,027 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-24 13:47:24,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 13:47:24,027 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-24 13:47:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-24 13:47:24,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:24,027 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-24 13:47:24,028 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:24,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-24 13:47:24,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:24,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:24,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:24,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:24,519 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:24,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:24,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:24,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:24,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:24,520 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 [2018-12-24 13:47:24,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:24,529 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:24,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-24 13:47:24,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:24,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:24,590 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:25,800 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:25,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:25,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-24 13:47:25,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:25,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-24 13:47:25,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-24 13:47:25,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:25,822 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-24 13:47:25,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:25,980 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-24 13:47:25,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 13:47:25,981 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-24 13:47:25,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:25,981 INFO L225 Difference]: With dead ends: 33 [2018-12-24 13:47:25,981 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 13:47:25,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:25,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 13:47:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-24 13:47:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:47:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-24 13:47:25,987 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-24 13:47:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:25,987 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-24 13:47:25,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-24 13:47:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-24 13:47:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 13:47:25,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:25,988 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-24 13:47:25,988 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-24 13:47:25,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:25,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:25,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:26,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:26,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:26,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:26,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:26,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:26,647 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 [2018-12-24 13:47:26,657 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:26,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:26,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:26,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:26,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:26,693 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:26,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:27,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:27,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-24 13:47:27,593 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:27,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 13:47:27,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 13:47:27,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 13:47:27,595 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-24 13:47:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:27,629 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-24 13:47:27,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 13:47:27,630 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-24 13:47:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:27,631 INFO L225 Difference]: With dead ends: 34 [2018-12-24 13:47:27,631 INFO L226 Difference]: Without dead ends: 32 [2018-12-24 13:47:27,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 13:47:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-24 13:47:27,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-24 13:47:27,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-24 13:47:27,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-24 13:47:27,635 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-24 13:47:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:27,636 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-24 13:47:27,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 13:47:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-24 13:47:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-24 13:47:27,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:27,637 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-24 13:47:27,637 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:27,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:27,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-24 13:47:27,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:27,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:27,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:28,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:28,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:28,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:28,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:28,206 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 [2018-12-24 13:47:28,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:28,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:28,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:29,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:29,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-24 13:47:29,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:29,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-24 13:47:29,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-24 13:47:29,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 13:47:29,257 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-24 13:47:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:29,367 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-24 13:47:29,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 13:47:29,368 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-24 13:47:29,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:29,368 INFO L225 Difference]: With dead ends: 35 [2018-12-24 13:47:29,368 INFO L226 Difference]: Without dead ends: 33 [2018-12-24 13:47:29,370 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 [2018-12-24 13:47:29,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-24 13:47:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-24 13:47:29,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 13:47:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-24 13:47:29,373 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-24 13:47:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:29,374 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-24 13:47:29,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-24 13:47:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-24 13:47:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 13:47:29,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:29,375 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-24 13:47:29,375 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:29,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:29,375 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-24 13:47:29,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:29,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:29,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:29,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:29,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:30,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:30,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:30,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:30,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:30,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:30,378 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 [2018-12-24 13:47:30,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:30,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:30,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-24 13:47:30,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:30,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:30,464 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:30,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:31,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:31,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-24 13:47:31,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:31,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 13:47:31,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 13:47:31,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:31,987 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-24 13:47:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:32,038 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-24 13:47:32,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 13:47:32,039 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-24 13:47:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:32,040 INFO L225 Difference]: With dead ends: 36 [2018-12-24 13:47:32,040 INFO L226 Difference]: Without dead ends: 34 [2018-12-24 13:47:32,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:32,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-24 13:47:32,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-24 13:47:32,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 13:47:32,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-24 13:47:32,044 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-24 13:47:32,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:32,044 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-24 13:47:32,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 13:47:32,044 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-24 13:47:32,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-24 13:47:32,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:32,045 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-24 13:47:32,045 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:32,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:32,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-24 13:47:32,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:32,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:32,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:32,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:32,795 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:32,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:32,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:32,796 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:32,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:32,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:32,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:32,806 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:32,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:32,834 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:32,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:32,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:32,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:33,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:33,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-24 13:47:33,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:33,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-24 13:47:33,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-24 13:47:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 13:47:33,899 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-24 13:47:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:33,978 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-24 13:47:33,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 13:47:33,978 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-24 13:47:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:33,979 INFO L225 Difference]: With dead ends: 37 [2018-12-24 13:47:33,979 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:47:33,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 13:47:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:47:33,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-24 13:47:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 13:47:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-24 13:47:33,982 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-24 13:47:33,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:33,982 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-24 13:47:33,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-24 13:47:33,982 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-24 13:47:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-24 13:47:33,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:33,983 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-24 13:47:33,983 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:33,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:33,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-24 13:47:33,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:33,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:33,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:33,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:33,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:33,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:34,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:34,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:34,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:34,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:34,426 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 [2018-12-24 13:47:34,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:34,434 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:34,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:34,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:34,470 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:35,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:35,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-24 13:47:35,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:35,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 13:47:35,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 13:47:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 13:47:35,901 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-24 13:47:35,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:35,971 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-24 13:47:35,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 13:47:35,972 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-24 13:47:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:35,972 INFO L225 Difference]: With dead ends: 38 [2018-12-24 13:47:35,972 INFO L226 Difference]: Without dead ends: 36 [2018-12-24 13:47:35,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 13:47:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-24 13:47:35,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-24 13:47:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-24 13:47:35,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-24 13:47:35,977 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-24 13:47:35,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:35,977 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-24 13:47:35,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 13:47:35,977 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-24 13:47:35,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-24 13:47:35,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:35,978 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-24 13:47:35,978 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:35,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-24 13:47:35,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:35,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:35,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:36,469 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:36,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:36,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:36,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:36,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:36,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:36,470 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 [2018-12-24 13:47:36,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:36,483 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:36,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-24 13:47:36,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:36,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:36,569 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:36,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-24 13:47:37,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:37,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-24 13:47:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-24 13:47:37,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:37,874 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-24 13:47:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:37,941 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-24 13:47:37,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 13:47:37,941 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-24 13:47:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:37,942 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:47:37,942 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 13:47:37,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:37,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 13:47:37,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-24 13:47:37,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:47:37,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-24 13:47:37,946 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-24 13:47:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:37,946 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-24 13:47:37,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-24 13:47:37,947 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-24 13:47:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 13:47:37,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:37,947 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-24 13:47:37,947 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:37,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:37,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-24 13:47:37,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:37,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:37,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:37,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:37,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:38,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:38,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:38,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:38,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:38,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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:38,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:38,558 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:38,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:38,599 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:38,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:39,949 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:39,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:39,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-24 13:47:39,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:39,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 13:47:39,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 13:47:39,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:47:39,971 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-24 13:47:40,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:40,113 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-24 13:47:40,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 13:47:40,113 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-24 13:47:40,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:40,113 INFO L225 Difference]: With dead ends: 40 [2018-12-24 13:47:40,114 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:47:40,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:47:40,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:47:40,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-24 13:47:40,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-24 13:47:40,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-24 13:47:40,116 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-24 13:47:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:40,116 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-24 13:47:40,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 13:47:40,117 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-24 13:47:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-24 13:47:40,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:40,117 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-24 13:47:40,117 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-24 13:47:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:40,118 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:40,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:41,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:41,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:41,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:41,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:41,227 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 [2018-12-24 13:47:41,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:41,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:41,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:41,288 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:42,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:42,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-24 13:47:42,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:42,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-24 13:47:42,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-24 13:47:42,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 13:47:42,669 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-24 13:47:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:42,740 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-24 13:47:42,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 13:47:42,740 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-24 13:47:42,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:42,741 INFO L225 Difference]: With dead ends: 41 [2018-12-24 13:47:42,741 INFO L226 Difference]: Without dead ends: 39 [2018-12-24 13:47:42,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 13:47:42,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-24 13:47:42,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-24 13:47:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:47:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-24 13:47:42,745 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-24 13:47:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:42,745 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-24 13:47:42,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-24 13:47:42,745 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-24 13:47:42,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-24 13:47:42,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:42,746 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-24 13:47:42,746 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:42,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:42,747 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-24 13:47:42,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:42,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:42,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:42,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:43,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:43,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:43,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:43,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:43,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:43,280 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 [2018-12-24 13:47:43,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:43,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:43,434 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-24 13:47:43,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:43,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:43,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:45,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:45,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-24 13:47:45,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:45,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 13:47:45,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 13:47:45,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:45,625 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-24 13:47:45,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:45,678 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-24 13:47:45,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 13:47:45,679 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-24 13:47:45,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:45,679 INFO L225 Difference]: With dead ends: 42 [2018-12-24 13:47:45,679 INFO L226 Difference]: Without dead ends: 40 [2018-12-24 13:47:45,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:45,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-24 13:47:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-24 13:47:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:47:45,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-24 13:47:45,682 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-24 13:47:45,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:45,683 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-24 13:47:45,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 13:47:45,683 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-24 13:47:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-24 13:47:45,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:45,683 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-24 13:47:45,683 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-24 13:47:45,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:45,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:45,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:45,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:45,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:46,507 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:46,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:46,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:46,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:46,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:46,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:46,508 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 [2018-12-24 13:47:46,517 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:46,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:46,552 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:46,553 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:46,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:46,562 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:46,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:48,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:48,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-24 13:47:48,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:48,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-24 13:47:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-24 13:47:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 13:47:48,151 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-24 13:47:48,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:48,219 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-24 13:47:48,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 13:47:48,220 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-24 13:47:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:48,220 INFO L225 Difference]: With dead ends: 43 [2018-12-24 13:47:48,220 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 13:47:48,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 13:47:48,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 13:47:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-24 13:47:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:47:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-24 13:47:48,224 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-24 13:47:48,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:48,224 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-24 13:47:48,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-24 13:47:48,225 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-24 13:47:48,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 13:47:48,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:48,225 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-24 13:47:48,225 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:48,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:48,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-24 13:47:48,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:48,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:48,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:48,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:48,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:49,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:49,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:49,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:49,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:49,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:49,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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:49,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:49,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:49,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:49,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:51,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:51,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-24 13:47:51,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:51,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 13:47:51,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 13:47:51,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 13:47:51,143 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-24 13:47:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:51,231 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-24 13:47:51,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 13:47:51,232 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-24 13:47:51,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:51,232 INFO L225 Difference]: With dead ends: 44 [2018-12-24 13:47:51,232 INFO L226 Difference]: Without dead ends: 42 [2018-12-24 13:47:51,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 13:47:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-24 13:47:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-24 13:47:51,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-24 13:47:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-24 13:47:51,235 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-24 13:47:51,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:51,236 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-24 13:47:51,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 13:47:51,236 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-24 13:47:51,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-24 13:47:51,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:51,237 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-24 13:47:51,237 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:51,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:51,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-24 13:47:51,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:51,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:51,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:51,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:51,929 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:51,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:51,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:51,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:51,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:51,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:51,930 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 [2018-12-24 13:47:51,939 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:51,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:52,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-24 13:47:52,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:52,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:52,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:53,834 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:53,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:53,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-24 13:47:53,853 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:53,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-24 13:47:53,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-24 13:47:53,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:53,854 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-24 13:47:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:53,924 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-24 13:47:53,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 13:47:53,924 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-24 13:47:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:53,925 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:47:53,925 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 13:47:53,926 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 [2018-12-24 13:47:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 13:47:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-24 13:47:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 13:47:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-24 13:47:53,929 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-24 13:47:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:53,929 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-24 13:47:53,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-24 13:47:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-24 13:47:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 13:47:53,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:53,930 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-24 13:47:53,930 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:53,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-24 13:47:53,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:53,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:53,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:53,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:54,678 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:54,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:54,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:54,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:54,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:54,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:54,679 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 [2018-12-24 13:47:54,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:54,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:54,726 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:54,726 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:54,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:54,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:56,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-24 13:47:56,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:56,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 13:47:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 13:47:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 13:47:56,715 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-24 13:47:56,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:56,787 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-24 13:47:56,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 13:47:56,787 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-24 13:47:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:56,788 INFO L225 Difference]: With dead ends: 46 [2018-12-24 13:47:56,788 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:47:56,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 13:47:56,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:47:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-24 13:47:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-24 13:47:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-24 13:47:56,790 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-24 13:47:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:56,790 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-24 13:47:56,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 13:47:56,790 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-24 13:47:56,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-24 13:47:56,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:56,791 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-24 13:47:56,791 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:56,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-24 13:47:56,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:56,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:56,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:56,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:57,515 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:57,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:57,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:57,515 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:57,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:57,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:57,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:57,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:57,523 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:57,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:57,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:59,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:59,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-24 13:47:59,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:59,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-24 13:47:59,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-24 13:47:59,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 13:47:59,657 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-24 13:47:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:59,759 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-24 13:47:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 13:47:59,760 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-24 13:47:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:59,760 INFO L225 Difference]: With dead ends: 47 [2018-12-24 13:47:59,760 INFO L226 Difference]: Without dead ends: 45 [2018-12-24 13:47:59,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 13:47:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-24 13:47:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-24 13:47:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 13:47:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-24 13:47:59,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-24 13:47:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:59,763 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-24 13:47:59,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-24 13:47:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-24 13:47:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 13:47:59,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:59,764 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-24 13:47:59,764 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:59,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:59,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-24 13:47:59,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:59,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:00,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:00,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:00,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:00,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:00,924 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 [2018-12-24 13:48:00,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:00,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:01,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-24 13:48:01,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:01,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:01,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:03,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:03,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-24 13:48:03,037 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:03,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 13:48:03,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 13:48:03,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:48:03,038 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-24 13:48:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:03,117 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-24 13:48:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 13:48:03,117 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-24 13:48:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:03,118 INFO L225 Difference]: With dead ends: 48 [2018-12-24 13:48:03,118 INFO L226 Difference]: Without dead ends: 46 [2018-12-24 13:48:03,118 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 [2018-12-24 13:48:03,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-24 13:48:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-24 13:48:03,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 13:48:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-24 13:48:03,120 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-24 13:48:03,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:03,120 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-24 13:48:03,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 13:48:03,120 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-24 13:48:03,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-24 13:48:03,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:03,121 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-24 13:48:03,121 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:03,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:03,121 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-24 13:48:03,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:03,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:03,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:03,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:03,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:03,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:03,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:03,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:03,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:03,907 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 [2018-12-24 13:48:03,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:03,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:03,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:03,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:03,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:03,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:06,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:06,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-24 13:48:06,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:06,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-24 13:48:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-24 13:48:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 13:48:06,250 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-24 13:48:06,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:06,301 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-24 13:48:06,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 13:48:06,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-24 13:48:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:06,302 INFO L225 Difference]: With dead ends: 49 [2018-12-24 13:48:06,302 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 13:48:06,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 13:48:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 13:48:06,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-24 13:48:06,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 13:48:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-24 13:48:06,305 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-24 13:48:06,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:06,305 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-24 13:48:06,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-24 13:48:06,305 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-24 13:48:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-24 13:48:06,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:06,306 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-24 13:48:06,306 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:06,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-24 13:48:06,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:06,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:06,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:06,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:07,154 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:07,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:07,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:07,155 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:07,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:07,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:07,156 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 [2018-12-24 13:48:07,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:07,169 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:07,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:07,223 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:07,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:09,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:09,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-24 13:48:09,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:09,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 13:48:09,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 13:48:09,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 13:48:09,357 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-24 13:48:09,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:09,428 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-24 13:48:09,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 13:48:09,429 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-24 13:48:09,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:09,430 INFO L225 Difference]: With dead ends: 50 [2018-12-24 13:48:09,430 INFO L226 Difference]: Without dead ends: 48 [2018-12-24 13:48:09,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 13:48:09,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-24 13:48:09,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-24 13:48:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-24 13:48:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-24 13:48:09,432 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-24 13:48:09,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:09,433 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-24 13:48:09,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 13:48:09,433 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-24 13:48:09,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-24 13:48:09,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:09,433 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-24 13:48:09,434 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:09,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:09,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-24 13:48:09,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:09,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:09,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:09,435 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:09,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:10,319 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:10,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:10,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:10,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:10,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:10,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:10,320 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 [2018-12-24 13:48:10,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:10,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:10,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-24 13:48:10,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:10,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:10,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:12,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:12,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-24 13:48:12,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:12,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-24 13:48:12,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-24 13:48:12,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:12,949 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-24 13:48:13,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:13,033 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-24 13:48:13,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 13:48:13,034 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-24 13:48:13,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:13,035 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:48:13,035 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 13:48:13,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:13,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 13:48:13,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-24 13:48:13,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 13:48:13,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-24 13:48:13,039 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-24 13:48:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:13,039 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-24 13:48:13,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-24 13:48:13,040 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-24 13:48:13,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 13:48:13,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:13,040 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-24 13:48:13,040 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:13,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:13,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-24 13:48:13,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:13,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:13,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:13,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:13,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:14,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:14,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:14,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:14,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:14,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:14,127 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 [2018-12-24 13:48:14,139 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:14,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:14,184 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:14,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:14,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:14,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:16,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:16,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-24 13:48:16,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:16,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 13:48:16,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 13:48:16,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:48:16,687 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-24 13:48:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:17,128 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-24 13:48:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 13:48:17,129 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-24 13:48:17,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:17,130 INFO L225 Difference]: With dead ends: 52 [2018-12-24 13:48:17,130 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 13:48:17,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:48:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 13:48:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-24 13:48:17,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-24 13:48:17,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-24 13:48:17,133 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-24 13:48:17,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:17,133 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-24 13:48:17,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 13:48:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-24 13:48:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-24 13:48:17,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:17,134 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-24 13:48:17,135 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-24 13:48:17,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:17,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:17,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:17,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:18,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:18,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:18,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:18,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:18,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:18,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:18,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:18,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:18,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:18,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:20,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:20,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-24 13:48:20,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:20,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-24 13:48:20,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-24 13:48:20,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 13:48:20,764 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-24 13:48:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:20,860 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-24 13:48:20,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 13:48:20,860 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-24 13:48:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:20,861 INFO L225 Difference]: With dead ends: 53 [2018-12-24 13:48:20,861 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 13:48:20,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 13:48:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 13:48:20,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-24 13:48:20,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 13:48:20,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-24 13:48:20,863 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-24 13:48:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:20,864 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-24 13:48:20,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-24 13:48:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-24 13:48:20,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-24 13:48:20,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:20,864 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-24 13:48:20,864 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:20,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-24 13:48:20,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:20,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:20,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:20,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:20,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:22,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:22,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:22,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:22,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:22,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:22,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:22,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:22,183 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:22,184 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:22,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-24 13:48:22,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:22,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:22,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:22,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:24,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:24,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:24,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-24 13:48:24,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:24,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 13:48:24,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 13:48:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:24,865 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-24 13:48:24,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:24,924 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-24 13:48:24,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 13:48:24,925 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-24 13:48:24,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:24,926 INFO L225 Difference]: With dead ends: 54 [2018-12-24 13:48:24,926 INFO L226 Difference]: Without dead ends: 52 [2018-12-24 13:48:24,927 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 [2018-12-24 13:48:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-24 13:48:24,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-24 13:48:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 13:48:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-24 13:48:24,930 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-24 13:48:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:24,930 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-24 13:48:24,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 13:48:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-24 13:48:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-24 13:48:24,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:24,931 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-24 13:48:24,931 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-24 13:48:24,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:24,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:24,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:24,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:24,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:26,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:26,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:26,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:26,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:26,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:26,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:26,003 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 [2018-12-24 13:48:26,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:26,012 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:26,057 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:26,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:26,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:26,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:26,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:28,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:28,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-24 13:48:28,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:28,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-24 13:48:28,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-24 13:48:28,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 13:48:28,926 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-24 13:48:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:29,095 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-24 13:48:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 13:48:29,096 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-24 13:48:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:29,096 INFO L225 Difference]: With dead ends: 55 [2018-12-24 13:48:29,096 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 13:48:29,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 13:48:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 13:48:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-24 13:48:29,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 13:48:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-24 13:48:29,100 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-24 13:48:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:29,101 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-24 13:48:29,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-24 13:48:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-24 13:48:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 13:48:29,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:29,101 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-24 13:48:29,102 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:29,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:29,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-24 13:48:29,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:29,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:29,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:29,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:30,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:30,363 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:30,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:30,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,364 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 [2018-12-24 13:48:30,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:30,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:30,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:30,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:33,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:33,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-24 13:48:33,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:33,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 13:48:33,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 13:48:33,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 13:48:33,573 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-24 13:48:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:33,634 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-24 13:48:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 13:48:33,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-24 13:48:33,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:33,635 INFO L225 Difference]: With dead ends: 56 [2018-12-24 13:48:33,635 INFO L226 Difference]: Without dead ends: 54 [2018-12-24 13:48:33,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 13:48:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-24 13:48:33,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-24 13:48:33,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-24 13:48:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-24 13:48:33,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-24 13:48:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:33,639 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-24 13:48:33,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 13:48:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-24 13:48:33,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-24 13:48:33,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:33,639 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-24 13:48:33,640 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:33,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:33,640 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-24 13:48:33,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:33,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:33,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:33,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:33,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:33,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:34,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:34,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:34,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:34,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:34,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:34,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:34,715 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 [2018-12-24 13:48:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:34,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:34,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-24 13:48:34,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:34,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:34,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:34,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:38,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:38,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-24 13:48:38,154 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:38,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-24 13:48:38,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-24 13:48:38,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:38,155 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-24 13:48:38,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:38,340 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-24 13:48:38,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 13:48:38,340 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-24 13:48:38,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:38,341 INFO L225 Difference]: With dead ends: 57 [2018-12-24 13:48:38,342 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:48:38,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:48:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-24 13:48:38,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 13:48:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-24 13:48:38,345 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-24 13:48:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:38,345 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-24 13:48:38,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-24 13:48:38,345 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-24 13:48:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 13:48:38,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:38,346 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-24 13:48:38,346 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:38,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:38,346 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-24 13:48:38,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:38,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:38,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:38,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:38,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:39,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:39,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:39,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:39,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:39,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:39,454 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 [2018-12-24 13:48:39,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:39,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:39,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:39,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:39,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:39,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:42,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:42,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:42,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-24 13:48:42,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:42,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 13:48:42,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 13:48:42,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 13:48:42,746 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-24 13:48:42,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:42,843 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-24 13:48:42,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 13:48:42,844 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-24 13:48:42,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:42,845 INFO L225 Difference]: With dead ends: 58 [2018-12-24 13:48:42,845 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 13:48:42,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 13:48:42,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 13:48:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-24 13:48:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-24 13:48:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-24 13:48:42,848 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-24 13:48:42,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:42,848 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-24 13:48:42,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 13:48:42,848 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-24 13:48:42,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-24 13:48:42,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:42,849 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-24 13:48:42,849 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:42,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:42,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-24 13:48:42,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:42,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:42,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:42,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:42,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:44,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:44,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:44,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:44,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:44,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:44,100 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 [2018-12-24 13:48:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:44,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:44,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:44,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:44,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:47,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:47,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-24 13:48:47,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:47,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-24 13:48:47,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-24 13:48:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 13:48:47,711 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-24 13:48:47,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:47,808 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-24 13:48:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 13:48:47,809 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-24 13:48:47,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:47,809 INFO L225 Difference]: With dead ends: 59 [2018-12-24 13:48:47,809 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 13:48:47,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 13:48:47,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 13:48:47,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-24 13:48:47,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 13:48:47,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-24 13:48:47,812 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-24 13:48:47,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:47,812 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-24 13:48:47,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-24 13:48:47,812 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-24 13:48:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 13:48:47,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:47,813 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-24 13:48:47,813 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:47,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:47,814 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-24 13:48:47,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:47,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:47,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:47,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:48,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:48,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:48,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:48,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:48,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:48,945 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 [2018-12-24 13:48:48,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:48,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:49,220 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-24 13:48:49,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:49,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:49,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:49,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:52,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:52,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-24 13:48:52,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:52,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 13:48:52,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 13:48:52,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:52,522 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-24 13:48:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:52,592 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-24 13:48:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 13:48:52,593 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-24 13:48:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:52,594 INFO L225 Difference]: With dead ends: 60 [2018-12-24 13:48:52,594 INFO L226 Difference]: Without dead ends: 58 [2018-12-24 13:48:52,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-24 13:48:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-24 13:48:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-24 13:48:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-24 13:48:52,597 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-24 13:48:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:52,598 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-24 13:48:52,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 13:48:52,598 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-24 13:48:52,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-24 13:48:52,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:52,598 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-24 13:48:52,599 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:52,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:52,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-24 13:48:52,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:52,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:52,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:52,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:52,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:53,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:53,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:53,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:53,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:53,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 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 [2018-12-24 13:48:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:53,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:53,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:53,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:53,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:53,873 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:57,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:57,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-24 13:48:57,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:57,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-24 13:48:57,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-24 13:48:57,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 13:48:57,242 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-24 13:48:57,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:57,333 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-24 13:48:57,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 13:48:57,333 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-24 13:48:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:57,334 INFO L225 Difference]: With dead ends: 61 [2018-12-24 13:48:57,334 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 13:48:57,335 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 [2018-12-24 13:48:57,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 13:48:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-24 13:48:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 13:48:57,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-24 13:48:57,338 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-24 13:48:57,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:57,338 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-24 13:48:57,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-24 13:48:57,338 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-24 13:48:57,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-24 13:48:57,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:57,339 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-24 13:48:57,339 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:57,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-24 13:48:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:57,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:57,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:57,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:00,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:00,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:00,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:00,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:00,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:00,131 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 [2018-12-24 13:49:00,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:00,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:00,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:00,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:00,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:03,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:03,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:03,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-24 13:49:03,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:03,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 13:49:03,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 13:49:03,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 13:49:03,761 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-24 13:49:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:03,889 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-24 13:49:03,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 13:49:03,890 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-24 13:49:03,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:03,891 INFO L225 Difference]: With dead ends: 62 [2018-12-24 13:49:03,891 INFO L226 Difference]: Without dead ends: 60 [2018-12-24 13:49:03,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 13:49:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-24 13:49:03,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-24 13:49:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-24 13:49:03,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-24 13:49:03,894 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-24 13:49:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:03,894 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-24 13:49:03,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 13:49:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-24 13:49:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-24 13:49:03,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:03,895 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-24 13:49:03,895 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:03,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:03,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-24 13:49:03,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:03,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:03,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:03,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:03,896 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:05,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:05,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:05,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:05,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:05,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:05,892 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 [2018-12-24 13:49:05,901 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:05,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:06,198 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-24 13:49:06,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:06,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:06,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:09,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:09,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-24 13:49:09,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:09,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-24 13:49:09,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-24 13:49:09,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:49:09,888 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-24 13:49:09,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:09,968 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-24 13:49:09,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 13:49:09,968 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-24 13:49:09,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:09,969 INFO L225 Difference]: With dead ends: 63 [2018-12-24 13:49:09,969 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 13:49:09,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:49:09,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 13:49:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-24 13:49:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:49:09,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 13:49:09,973 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-24 13:49:09,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:09,974 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 13:49:09,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-24 13:49:09,974 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 13:49:09,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 13:49:09,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:09,974 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-24 13:49:09,975 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:09,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-24 13:49:09,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:09,976 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:09,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:11,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:11,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:11,357 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:11,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:11,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:11,357 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 [2018-12-24 13:49:11,370 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:11,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:11,423 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:11,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:11,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:11,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:11,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:15,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:15,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:15,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-24 13:49:15,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:15,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 13:49:15,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 13:49:15,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:49:15,923 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-24 13:49:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:16,029 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-24 13:49:16,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 13:49:16,029 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-24 13:49:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:16,030 INFO L225 Difference]: With dead ends: 64 [2018-12-24 13:49:16,030 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 13:49:16,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:49:16,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 13:49:16,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-24 13:49:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-24 13:49:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-24 13:49:16,033 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-24 13:49:16,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:16,033 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-24 13:49:16,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 13:49:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-24 13:49:16,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-24 13:49:16,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:16,034 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-24 13:49:16,034 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:16,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-24 13:49:16,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:16,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:16,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:16,035 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:17,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:17,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:17,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:17,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:17,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:17,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:17,505 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 [2018-12-24 13:49:17,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:17,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:17,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:17,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:21,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:21,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:21,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-24 13:49:21,601 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:21,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-24 13:49:21,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-24 13:49:21,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 13:49:21,602 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-24 13:49:21,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:21,696 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-24 13:49:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 13:49:21,696 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-24 13:49:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:21,697 INFO L225 Difference]: With dead ends: 65 [2018-12-24 13:49:21,697 INFO L226 Difference]: Without dead ends: 63 [2018-12-24 13:49:21,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 13:49:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-24 13:49:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-24 13:49:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 13:49:21,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-24 13:49:21,700 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-24 13:49:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:21,700 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-24 13:49:21,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-24 13:49:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-24 13:49:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-24 13:49:21,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:21,701 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-24 13:49:21,702 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-24 13:49:21,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:21,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:21,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:21,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:21,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:23,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:23,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:23,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:23,592 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:23,592 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:23,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:23,592 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 [2018-12-24 13:49:23,601 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:23,601 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:23,975 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-24 13:49:23,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:23,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:23,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:28,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:28,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-24 13:49:28,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:28,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 13:49:28,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 13:49:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:49:28,189 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-24 13:49:28,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:28,267 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-24 13:49:28,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 13:49:28,267 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-24 13:49:28,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:28,268 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:49:28,268 INFO L226 Difference]: Without dead ends: 64 [2018-12-24 13:49:28,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:49:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-24 13:49:28,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-24 13:49:28,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-24 13:49:28,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-24 13:49:28,271 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-24 13:49:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:28,271 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-24 13:49:28,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 13:49:28,272 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-24 13:49:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-24 13:49:28,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:28,272 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-24 13:49:28,272 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:28,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-24 13:49:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:28,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:28,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:28,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:28,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:29,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:29,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:29,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:29,831 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 [2018-12-24 13:49:29,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:29,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:29,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:29,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:29,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:29,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:34,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:34,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-24 13:49:34,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:34,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-24 13:49:34,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-24 13:49:34,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 13:49:34,146 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-24 13:49:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:34,281 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-24 13:49:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 13:49:34,282 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-24 13:49:34,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:34,282 INFO L225 Difference]: With dead ends: 67 [2018-12-24 13:49:34,282 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:49:34,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 13:49:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:49:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-24 13:49:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 13:49:34,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-24 13:49:34,285 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-24 13:49:34,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:34,285 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-24 13:49:34,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-24 13:49:34,285 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-24 13:49:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 13:49:34,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:34,286 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-24 13:49:34,286 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-24 13:49:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:34,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:34,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:34,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:35,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:35,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:35,799 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:35,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:35,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:35,799 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 [2018-12-24 13:49:35,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:35,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:35,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:35,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:40,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:40,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:40,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-24 13:49:40,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:40,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 13:49:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 13:49:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 13:49:40,335 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-24 13:49:40,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:40,480 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-24 13:49:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 13:49:40,480 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-24 13:49:40,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:40,481 INFO L225 Difference]: With dead ends: 68 [2018-12-24 13:49:40,481 INFO L226 Difference]: Without dead ends: 66 [2018-12-24 13:49:40,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 13:49:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-24 13:49:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-24 13:49:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-24 13:49:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-24 13:49:40,484 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-24 13:49:40,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:40,484 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-24 13:49:40,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 13:49:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-24 13:49:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-24 13:49:40,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:40,484 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-24 13:49:40,485 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:40,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:40,485 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-24 13:49:40,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:40,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:40,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:40,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:40,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:41,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:41,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:41,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:41,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:41,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:41,992 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 [2018-12-24 13:49:42,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:42,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:42,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-24 13:49:42,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:42,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:42,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:46,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:46,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-24 13:49:46,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:46,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-24 13:49:46,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-24 13:49:46,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:49:46,912 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-24 13:49:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:47,032 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-24 13:49:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 13:49:47,032 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-24 13:49:47,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:47,033 INFO L225 Difference]: With dead ends: 69 [2018-12-24 13:49:47,033 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:49:47,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:49:47,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:49:47,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-24 13:49:47,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 13:49:47,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-24 13:49:47,037 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-24 13:49:47,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:47,037 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-24 13:49:47,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-24 13:49:47,037 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-24 13:49:47,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 13:49:47,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:47,038 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-24 13:49:47,038 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:47,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:47,038 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-24 13:49:47,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:47,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:47,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:47,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:47,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:47,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:48,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:48,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:48,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:48,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:48,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:48,839 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 [2018-12-24 13:49:48,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:48,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:48,926 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:48,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:48,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:48,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:53,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:53,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-24 13:49:53,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:53,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 13:49:53,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 13:49:53,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 13:49:53,449 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-24 13:49:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:53,626 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-24 13:49:53,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 13:49:53,634 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-24 13:49:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:53,634 INFO L225 Difference]: With dead ends: 70 [2018-12-24 13:49:53,635 INFO L226 Difference]: Without dead ends: 68 [2018-12-24 13:49:53,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 13:49:53,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-24 13:49:53,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-24 13:49:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-24 13:49:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-24 13:49:53,639 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-24 13:49:53,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:53,639 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-24 13:49:53,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 13:49:53,639 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-24 13:49:53,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-24 13:49:53,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:53,640 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-24 13:49:53,640 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:53,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-24 13:49:53,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:53,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:53,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:53,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:53,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:55,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:55,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:55,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:55,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:55,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:55,200 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 [2018-12-24 13:49:55,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:55,215 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:55,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:55,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:00,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:00,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-24 13:50:00,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:00,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-24 13:50:00,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-24 13:50:00,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 13:50:00,032 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-24 13:50:00,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:00,126 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-24 13:50:00,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 13:50:00,126 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-24 13:50:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:00,127 INFO L225 Difference]: With dead ends: 71 [2018-12-24 13:50:00,127 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 13:50:00,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 13:50:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 13:50:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-24 13:50:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 13:50:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-24 13:50:00,131 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-24 13:50:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:00,131 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-24 13:50:00,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-24 13:50:00,132 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-24 13:50:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 13:50:00,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:00,132 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-24 13:50:00,132 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:00,133 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-24 13:50:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:00,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:00,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:00,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:02,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:02,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:02,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:02,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:02,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:02,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:02,345 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 [2018-12-24 13:50:02,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:02,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:02,858 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-24 13:50:02,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:02,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:02,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:08,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:08,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-24 13:50:08,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:08,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 13:50:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 13:50:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:50:08,011 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-24 13:50:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:08,124 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-24 13:50:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 13:50:08,125 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-24 13:50:08,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:08,125 INFO L225 Difference]: With dead ends: 72 [2018-12-24 13:50:08,125 INFO L226 Difference]: Without dead ends: 70 [2018-12-24 13:50:08,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:50:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-24 13:50:08,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-24 13:50:08,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-24 13:50:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-24 13:50:08,129 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-24 13:50:08,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:08,129 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-24 13:50:08,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 13:50:08,129 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-24 13:50:08,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-24 13:50:08,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:08,129 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-24 13:50:08,130 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:08,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:08,130 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-24 13:50:08,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:08,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:08,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:08,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:08,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:08,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:10,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:10,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:10,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:10,148 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:10,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:10,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:10,148 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 [2018-12-24 13:50:10,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:10,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:10,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:10,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:10,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:10,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:16,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:16,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-24 13:50:16,387 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:16,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-24 13:50:16,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-24 13:50:16,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 13:50:16,388 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-24 13:50:16,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:16,695 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-24 13:50:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 13:50:16,695 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-24 13:50:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:16,696 INFO L225 Difference]: With dead ends: 73 [2018-12-24 13:50:16,696 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 13:50:16,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 13:50:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 13:50:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-24 13:50:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:50:16,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-24 13:50:16,699 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-24 13:50:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:16,700 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-24 13:50:16,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-24 13:50:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-24 13:50:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-24 13:50:16,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:16,701 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-24 13:50:16,701 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:16,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-24 13:50:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:16,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:16,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:16,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:18,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:18,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:18,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:18,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:18,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:18,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:18,404 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 [2018-12-24 13:50:18,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:18,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:18,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:18,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:23,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:23,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-24 13:50:23,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:23,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 13:50:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 13:50:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 13:50:23,863 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-24 13:50:23,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:23,973 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-24 13:50:23,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 13:50:23,973 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-24 13:50:23,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:23,973 INFO L225 Difference]: With dead ends: 74 [2018-12-24 13:50:23,973 INFO L226 Difference]: Without dead ends: 72 [2018-12-24 13:50:23,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 13:50:23,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-24 13:50:23,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-24 13:50:23,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-24 13:50:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-24 13:50:23,977 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-24 13:50:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:23,977 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-24 13:50:23,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 13:50:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-24 13:50:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-24 13:50:23,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:23,978 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-24 13:50:23,978 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:23,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:23,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-24 13:50:23,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:23,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:23,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:23,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:23,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:23,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:25,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:25,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:25,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:25,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:25,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:25,912 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:50:25,920 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:25,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:26,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-24 13:50:26,486 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:26,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:26,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:26,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:31,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:31,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:31,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-24 13:50:31,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:31,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-24 13:50:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-24 13:50:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:50:31,901 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-24 13:50:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:32,117 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 13:50:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 13:50:32,117 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-24 13:50:32,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:32,118 INFO L225 Difference]: With dead ends: 75 [2018-12-24 13:50:32,118 INFO L226 Difference]: Without dead ends: 73 [2018-12-24 13:50:32,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:50:32,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-24 13:50:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-24 13:50:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:50:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-24 13:50:32,121 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-24 13:50:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:32,121 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-24 13:50:32,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-24 13:50:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-24 13:50:32,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 13:50:32,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:32,122 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-24 13:50:32,122 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:32,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:32,122 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-24 13:50:32,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:32,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:32,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:32,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:32,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:33,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:33,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:33,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:33,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:33,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:33,960 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 [2018-12-24 13:50:33,968 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:33,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:34,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:34,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:34,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:34,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:34,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:39,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-24 13:50:39,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:39,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 13:50:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 13:50:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:50:39,757 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-24 13:50:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:39,921 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-24 13:50:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 13:50:39,922 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-24 13:50:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:39,922 INFO L225 Difference]: With dead ends: 76 [2018-12-24 13:50:39,922 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 13:50:39,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:50:39,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 13:50:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-24 13:50:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-24 13:50:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-24 13:50:39,926 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-24 13:50:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:39,926 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-24 13:50:39,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 13:50:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-24 13:50:39,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-24 13:50:39,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:39,927 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-24 13:50:39,927 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:39,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-24 13:50:39,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:39,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:39,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:39,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:39,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:42,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:42,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:42,192 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:42,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:42,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:42,192 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:50:42,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:42,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:42,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:42,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:42,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:47,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:47,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-24 13:50:47,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:47,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-24 13:50:47,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-24 13:50:47,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 13:50:47,931 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-24 13:50:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:48,161 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-24 13:50:48,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 13:50:48,162 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-24 13:50:48,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:48,162 INFO L225 Difference]: With dead ends: 77 [2018-12-24 13:50:48,163 INFO L226 Difference]: Without dead ends: 75 [2018-12-24 13:50:48,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 13:50:48,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-24 13:50:48,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-24 13:50:48,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 13:50:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-24 13:50:48,167 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-24 13:50:48,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:48,167 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-24 13:50:48,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-24 13:50:48,168 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-24 13:50:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-24 13:50:48,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:48,168 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-24 13:50:48,168 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:48,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:48,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-24 13:50:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:48,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:48,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:48,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:48,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:50,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:50,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:50,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:50,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:50,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:50,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 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 [2018-12-24 13:50:50,720 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:50,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:51,402 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-24 13:50:51,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:51,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:51,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:57,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:57,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-24 13:50:57,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:57,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 13:50:57,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 13:50:57,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:50:57,199 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-24 13:50:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:57,365 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-24 13:50:57,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 13:50:57,365 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-24 13:50:57,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:57,366 INFO L225 Difference]: With dead ends: 78 [2018-12-24 13:50:57,366 INFO L226 Difference]: Without dead ends: 76 [2018-12-24 13:50:57,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:50:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-24 13:50:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-24 13:50:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 13:50:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-24 13:50:57,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-24 13:50:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:57,370 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-24 13:50:57,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 13:50:57,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-24 13:50:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-24 13:50:57,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:57,370 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-24 13:50:57,371 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:57,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:57,371 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-24 13:50:57,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:57,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:57,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:57,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:57,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:59,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:59,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:59,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:59,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:59,320 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 [2018-12-24 13:50:59,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:59,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:59,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:59,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:59,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:59,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:05,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:05,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:05,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-24 13:51:05,679 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:05,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-24 13:51:05,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-24 13:51:05,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 13:51:05,680 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-24 13:51:05,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:05,832 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-24 13:51:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 13:51:05,832 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-24 13:51:05,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:05,833 INFO L225 Difference]: With dead ends: 79 [2018-12-24 13:51:05,833 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 13:51:05,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 13:51:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 13:51:05,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-24 13:51:05,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:51:05,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-24 13:51:05,836 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-24 13:51:05,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:05,836 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-24 13:51:05,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-24 13:51:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-24 13:51:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 13:51:05,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:05,837 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-24 13:51:05,837 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:05,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:05,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-24 13:51:05,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:05,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:05,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:05,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:05,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:07,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:07,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:07,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:07,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:07,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:07,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 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 [2018-12-24 13:51:07,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:07,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:07,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:07,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:07,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:13,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:13,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-24 13:51:13,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:13,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 13:51:13,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 13:51:13,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 13:51:13,945 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-24 13:51:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:14,104 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-24 13:51:14,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 13:51:14,105 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-24 13:51:14,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:14,105 INFO L225 Difference]: With dead ends: 80 [2018-12-24 13:51:14,105 INFO L226 Difference]: Without dead ends: 78 [2018-12-24 13:51:14,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 13:51:14,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-24 13:51:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-24 13:51:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-24 13:51:14,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-24 13:51:14,109 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-24 13:51:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:14,109 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-24 13:51:14,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 13:51:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-24 13:51:14,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-24 13:51:14,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:14,110 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-24 13:51:14,110 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:14,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:14,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-24 13:51:14,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:14,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:14,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:14,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:16,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:16,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:16,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:16,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:16,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:16,480 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 [2018-12-24 13:51:16,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:16,489 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:17,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-24 13:51:17,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:17,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:17,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:17,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:23,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:23,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:23,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-24 13:51:23,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:23,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-24 13:51:23,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-24 13:51:23,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:51:23,519 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-24 13:51:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:23,617 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-24 13:51:23,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 13:51:23,618 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-24 13:51:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:23,619 INFO L225 Difference]: With dead ends: 81 [2018-12-24 13:51:23,619 INFO L226 Difference]: Without dead ends: 79 [2018-12-24 13:51:23,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:51:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-24 13:51:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-24 13:51:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 13:51:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-24 13:51:23,623 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-24 13:51:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:23,623 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-24 13:51:23,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-24 13:51:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-24 13:51:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 13:51:23,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:23,624 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-24 13:51:23,624 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-24 13:51:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:23,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:26,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:26,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:26,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:26,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:26,063 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 [2018-12-24 13:51:26,072 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:26,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:26,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:26,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:26,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:26,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:32,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:32,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-24 13:51:32,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:32,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 13:51:32,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 13:51:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:51:32,382 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-24 13:51:32,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:32,498 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-24 13:51:32,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 13:51:32,499 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-24 13:51:32,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:32,500 INFO L225 Difference]: With dead ends: 82 [2018-12-24 13:51:32,500 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:51:32,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:51:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:51:32,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-24 13:51:32,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-24 13:51:32,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-24 13:51:32,503 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-24 13:51:32,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:32,503 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-24 13:51:32,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 13:51:32,504 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-24 13:51:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-24 13:51:32,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:32,504 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-24 13:51:32,504 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:32,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:32,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-24 13:51:32,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:32,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:32,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:32,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:34,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:34,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:34,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:34,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:34,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:34,691 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 [2018-12-24 13:51:34,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:34,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:34,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:34,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:34,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:34,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:41,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:41,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:41,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-24 13:51:41,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:41,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-24 13:51:41,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-24 13:51:41,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:51:41,490 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-24 13:51:41,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:41,876 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-24 13:51:41,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 13:51:41,876 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-24 13:51:41,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:41,877 INFO L225 Difference]: With dead ends: 83 [2018-12-24 13:51:41,877 INFO L226 Difference]: Without dead ends: 81 [2018-12-24 13:51:41,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:51:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-24 13:51:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-24 13:51:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 13:51:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-24 13:51:41,879 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-24 13:51:41,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:41,879 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-24 13:51:41,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-24 13:51:41,879 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-24 13:51:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 13:51:41,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:41,880 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-24 13:51:41,880 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:41,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:41,880 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-24 13:51:41,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:41,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:41,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:41,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:41,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:44,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:44,074 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:44,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:44,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:44,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 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 [2018-12-24 13:51:44,083 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:44,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:45,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-24 13:51:45,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:45,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:45,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:52,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:52,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-24 13:51:52,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:52,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 13:51:52,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 13:51:52,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:51:52,112 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-24 13:51:52,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:52,730 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-24 13:51:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 13:51:52,731 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-24 13:51:52,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:52,731 INFO L225 Difference]: With dead ends: 84 [2018-12-24 13:51:52,732 INFO L226 Difference]: Without dead ends: 82 [2018-12-24 13:51:52,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:51:52,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-24 13:51:52,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-24 13:51:52,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-24 13:51:52,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-24 13:51:52,735 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-24 13:51:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:52,736 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-24 13:51:52,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 13:51:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-24 13:51:52,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-24 13:51:52,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:52,736 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-24 13:51:52,737 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-24 13:51:52,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:52,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:52,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:52,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:52,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:55,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:55,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:55,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:55,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:55,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:55,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 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 [2018-12-24 13:51:55,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:55,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:55,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:55,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:55,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:55,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:55,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-24 13:52:02,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:02,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-24 13:52:02,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-24 13:52:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:52:02,382 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-24 13:52:02,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:02,546 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-24 13:52:02,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 13:52:02,546 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-24 13:52:02,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:02,547 INFO L225 Difference]: With dead ends: 85 [2018-12-24 13:52:02,547 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 13:52:02,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:52:02,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 13:52:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-24 13:52:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-24 13:52:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-24 13:52:02,551 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-24 13:52:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:02,551 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-24 13:52:02,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-24 13:52:02,551 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-24 13:52:02,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-24 13:52:02,552 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:02,552 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-24 13:52:02,552 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:02,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:02,552 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-24 13:52:02,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:02,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:05,223 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:05,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:05,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:05,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:05,224 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:05,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:05,224 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 [2018-12-24 13:52:05,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:05,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:05,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:05,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:12,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:12,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:12,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-24 13:52:12,745 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:12,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 13:52:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 13:52:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:52:12,746 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-24 13:52:12,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:12,857 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-24 13:52:12,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 13:52:12,858 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-24 13:52:12,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:12,858 INFO L225 Difference]: With dead ends: 86 [2018-12-24 13:52:12,858 INFO L226 Difference]: Without dead ends: 84 [2018-12-24 13:52:12,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:52:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-24 13:52:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-24 13:52:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-24 13:52:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-24 13:52:12,862 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-24 13:52:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:12,862 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-24 13:52:12,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 13:52:12,862 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-24 13:52:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-24 13:52:12,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:12,863 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-24 13:52:12,863 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:12,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-24 13:52:12,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:12,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:12,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:12,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:15,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:15,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:15,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:15,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:15,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:15,280 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 [2018-12-24 13:52:15,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:15,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:16,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-24 13:52:16,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:16,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:16,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:16,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:23,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:23,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:23,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-24 13:52:23,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:23,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-24 13:52:23,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-24 13:52:23,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:52:23,793 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-24 13:52:23,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:23,976 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-24 13:52:23,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 13:52:23,976 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-24 13:52:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:23,977 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:52:23,977 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 13:52:23,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:52:23,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 13:52:23,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-24 13:52:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 13:52:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-24 13:52:23,979 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-24 13:52:23,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:23,980 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-24 13:52:23,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-24 13:52:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-24 13:52:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 13:52:23,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:23,980 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-24 13:52:23,980 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-24 13:52:23,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:23,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:23,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:23,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:26,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:26,634 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:26,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:26,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:26,635 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 [2018-12-24 13:52:26,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:26,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:26,717 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:26,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:26,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:26,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:34,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:34,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-24 13:52:34,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:34,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 13:52:34,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 13:52:34,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:52:34,359 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-24 13:52:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:34,530 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-24 13:52:34,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 13:52:34,531 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-24 13:52:34,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:34,531 INFO L225 Difference]: With dead ends: 88 [2018-12-24 13:52:34,531 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 13:52:34,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:52:34,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 13:52:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-24 13:52:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-24 13:52:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-24 13:52:34,534 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-24 13:52:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:34,534 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-24 13:52:34,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 13:52:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-24 13:52:34,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-24 13:52:34,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:34,535 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-24 13:52:34,535 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:34,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:34,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-24 13:52:34,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:34,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:34,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:34,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:37,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:37,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:37,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:37,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:37,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:37,023 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 [2018-12-24 13:52:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:37,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:37,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:37,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:45,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:45,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-24 13:52:45,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:45,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-24 13:52:45,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-24 13:52:45,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:52:45,044 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-24 13:52:45,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:45,285 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-24 13:52:45,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 13:52:45,286 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-24 13:52:45,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:45,286 INFO L225 Difference]: With dead ends: 89 [2018-12-24 13:52:45,286 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 13:52:45,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:52:45,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 13:52:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-24 13:52:45,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-24 13:52:45,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-24 13:52:45,290 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-24 13:52:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:45,290 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-24 13:52:45,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-24 13:52:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-24 13:52:45,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-24 13:52:45,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:45,291 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-24 13:52:45,291 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:45,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-24 13:52:45,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:45,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:45,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:45,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:45,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:48,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:48,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:48,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:48,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:48,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:48,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:48,091 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 [2018-12-24 13:52:48,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:48,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:49,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-24 13:52:49,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:49,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:49,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:49,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:56,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:56,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-24 13:52:56,925 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:56,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 13:52:56,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 13:52:56,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:52:56,927 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-24 13:52:57,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:57,069 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-24 13:52:57,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 13:52:57,069 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-24 13:52:57,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:57,070 INFO L225 Difference]: With dead ends: 90 [2018-12-24 13:52:57,070 INFO L226 Difference]: Without dead ends: 88 [2018-12-24 13:52:57,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:52:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-24 13:52:57,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-24 13:52:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-24 13:52:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-24 13:52:57,074 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-24 13:52:57,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:57,074 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-24 13:52:57,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 13:52:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-24 13:52:57,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-24 13:52:57,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:57,075 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-24 13:52:57,075 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:57,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-24 13:52:57,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:57,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:57,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:57,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:00,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:00,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:00,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:00,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:00,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:00,026 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 [2018-12-24 13:53:00,034 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:00,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:00,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:00,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:00,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:00,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:08,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:08,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:08,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-24 13:53:08,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:08,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-24 13:53:08,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-24 13:53:08,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:53:08,373 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-24 13:53:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:08,530 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-24 13:53:08,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 13:53:08,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-24 13:53:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:08,531 INFO L225 Difference]: With dead ends: 91 [2018-12-24 13:53:08,531 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 13:53:08,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:53:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 13:53:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-24 13:53:08,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 13:53:08,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-24 13:53:08,534 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-24 13:53:08,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:08,534 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-24 13:53:08,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-24 13:53:08,535 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-24 13:53:08,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 13:53:08,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:08,535 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-24 13:53:08,536 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:08,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:08,536 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-24 13:53:08,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:08,537 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:08,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:11,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:11,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:11,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:11,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:11,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-24 13:53:11,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:11,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:11,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:11,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:19,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:19,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:19,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-24 13:53:19,632 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:19,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 13:53:19,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 13:53:19,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:53:19,635 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-24 13:53:20,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:20,003 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-24 13:53:20,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 13:53:20,004 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-24 13:53:20,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:20,004 INFO L225 Difference]: With dead ends: 92 [2018-12-24 13:53:20,005 INFO L226 Difference]: Without dead ends: 90 [2018-12-24 13:53:20,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:53:20,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-24 13:53:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-24 13:53:20,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-24 13:53:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-24 13:53:20,008 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-24 13:53:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:20,008 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-24 13:53:20,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 13:53:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-24 13:53:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-24 13:53:20,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:20,009 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-24 13:53:20,009 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:20,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:20,009 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-24 13:53:20,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:20,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:20,010 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:22,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:22,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:22,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:22,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:22,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:22,767 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 [2018-12-24 13:53:22,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:22,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:24,038 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-24 13:53:24,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:24,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:24,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:24,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:32,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:32,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-24 13:53:32,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:32,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-24 13:53:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-24 13:53:32,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:53:32,484 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-24 13:53:32,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:32,708 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-24 13:53:32,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 13:53:32,708 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-24 13:53:32,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:32,709 INFO L225 Difference]: With dead ends: 93 [2018-12-24 13:53:32,709 INFO L226 Difference]: Without dead ends: 91 [2018-12-24 13:53:32,710 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 [2018-12-24 13:53:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-24 13:53:32,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-24 13:53:32,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 13:53:32,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-24 13:53:32,712 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-24 13:53:32,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:32,712 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-24 13:53:32,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-24 13:53:32,712 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-24 13:53:32,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 13:53:32,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:32,712 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-24 13:53:32,712 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:32,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:32,713 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-24 13:53:32,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:32,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:32,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:32,713 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:35,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:35,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:35,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:35,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:35,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:35,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:35,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 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 [2018-12-24 13:53:35,947 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:35,947 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:36,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:36,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:36,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:36,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:36,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:44,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:44,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-24 13:53:44,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:44,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 13:53:44,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 13:53:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:53:44,919 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-24 13:53:45,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:45,053 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-24 13:53:45,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 13:53:45,053 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-24 13:53:45,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:45,054 INFO L225 Difference]: With dead ends: 94 [2018-12-24 13:53:45,054 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 13:53:45,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:53:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 13:53:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-24 13:53:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-24 13:53:45,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-24 13:53:45,056 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-24 13:53:45,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:45,057 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-24 13:53:45,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 13:53:45,057 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-24 13:53:45,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-24 13:53:45,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:45,057 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-24 13:53:45,057 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:45,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-24 13:53:45,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:45,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:45,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:45,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:45,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:47,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:47,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:47,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:47,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:47,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:47,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 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 [2018-12-24 13:53:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:47,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:47,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:48,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:56,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:56,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:56,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-24 13:53:56,772 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:56,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-24 13:53:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-24 13:53:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:53:56,774 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-24 13:53:56,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:56,996 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-24 13:53:56,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 13:53:56,996 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-24 13:53:56,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:56,997 INFO L225 Difference]: With dead ends: 95 [2018-12-24 13:53:56,997 INFO L226 Difference]: Without dead ends: 93 [2018-12-24 13:53:56,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:53:56,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-24 13:53:56,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-24 13:53:56,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 13:53:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-24 13:53:56,999 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-24 13:53:56,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:56,999 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-24 13:53:57,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-24 13:53:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-24 13:53:57,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 13:53:57,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:57,000 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-24 13:53:57,000 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:57,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:57,001 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-24 13:53:57,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:57,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:57,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:57,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:00,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:00,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:00,114 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:00,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:00,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:00,115 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 [2018-12-24 13:54:00,124 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:00,124 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:01,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-24 13:54:01,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:01,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:01,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:10,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:10,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:10,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-24 13:54:10,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:10,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 13:54:10,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 13:54:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:10,819 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-24 13:54:10,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:10,979 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-24 13:54:10,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 13:54:10,979 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-24 13:54:10,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:10,980 INFO L225 Difference]: With dead ends: 96 [2018-12-24 13:54:10,980 INFO L226 Difference]: Without dead ends: 94 [2018-12-24 13:54:10,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-24 13:54:10,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-24 13:54:10,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-24 13:54:10,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-24 13:54:10,984 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-24 13:54:10,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:10,984 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-24 13:54:10,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 13:54:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-24 13:54:10,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-24 13:54:10,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:10,985 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-24 13:54:10,985 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:10,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-24 13:54:10,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:10,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:10,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:10,986 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:13,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:13,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:13,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:13,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:13,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:13,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:13,875 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 [2018-12-24 13:54:13,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:13,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:13,972 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:13,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:13,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:13,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:23,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:23,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-24 13:54:23,322 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:23,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-24 13:54:23,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-24 13:54:23,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:54:23,323 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-24 13:54:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:23,575 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-24 13:54:23,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 13:54:23,575 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-24 13:54:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:23,576 INFO L225 Difference]: With dead ends: 97 [2018-12-24 13:54:23,576 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 13:54:23,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:54:23,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 13:54:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-24 13:54:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 13:54:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-24 13:54:23,579 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-24 13:54:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:23,579 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-24 13:54:23,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-24 13:54:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-24 13:54:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-24 13:54:23,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:23,580 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-24 13:54:23,581 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:23,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:23,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-24 13:54:23,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:23,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:23,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:23,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:23,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:26,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:26,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:26,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:26,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:26,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:26,788 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 [2018-12-24 13:54:26,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:26,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:26,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:26,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:36,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:36,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-24 13:54:36,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:36,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 13:54:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 13:54:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:54:36,266 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-24 13:54:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:36,460 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-24 13:54:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 13:54:36,460 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-24 13:54:36,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:36,461 INFO L225 Difference]: With dead ends: 98 [2018-12-24 13:54:36,461 INFO L226 Difference]: Without dead ends: 96 [2018-12-24 13:54:36,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:54:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-24 13:54:36,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-24 13:54:36,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-24 13:54:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-24 13:54:36,465 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-24 13:54:36,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:36,465 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-24 13:54:36,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 13:54:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-24 13:54:36,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-24 13:54:36,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:36,466 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-24 13:54:36,466 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:36,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-24 13:54:36,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:36,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:36,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:36,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:36,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:39,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:39,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:39,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:39,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:39,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:39,694 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 [2018-12-24 13:54:39,703 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:39,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:41,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-24 13:54:41,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:41,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:41,342 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:50,824 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:50,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:50,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-24 13:54:50,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:50,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-24 13:54:50,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-24 13:54:50,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:54:50,847 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-24 13:54:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:51,017 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-24 13:54:51,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 13:54:51,018 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-24 13:54:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:51,018 INFO L225 Difference]: With dead ends: 99 [2018-12-24 13:54:51,018 INFO L226 Difference]: Without dead ends: 97 [2018-12-24 13:54:51,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:54:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-24 13:54:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-24 13:54:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:54:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-24 13:54:51,021 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-24 13:54:51,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:51,021 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-24 13:54:51,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-24 13:54:51,022 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-24 13:54:51,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 13:54:51,022 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:51,022 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-24 13:54:51,022 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:51,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-24 13:54:51,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:51,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:51,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:51,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:51,023 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:54,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:54,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:54,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:54,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:54,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:54,201 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 [2018-12-24 13:54:54,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:54,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:54,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:54,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:54,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:54,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:03,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:04,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:04,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-24 13:55:04,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:04,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 13:55:04,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 13:55:04,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:55:04,010 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-24 13:55:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:04,175 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-24 13:55:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 13:55:04,176 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-24 13:55:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:04,176 INFO L225 Difference]: With dead ends: 100 [2018-12-24 13:55:04,177 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 13:55:04,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:55:04,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 13:55:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-24 13:55:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-24 13:55:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-24 13:55:04,180 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-24 13:55:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:04,181 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-24 13:55:04,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 13:55:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-24 13:55:04,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-24 13:55:04,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:04,181 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-24 13:55:04,181 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-24 13:55:04,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:04,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:04,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:04,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:04,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:07,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:07,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:07,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:07,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:07,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:07,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 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 [2018-12-24 13:55:07,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:07,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:07,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:07,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:17,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:17,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:17,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-24 13:55:17,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:17,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-24 13:55:17,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-24 13:55:17,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:55:17,851 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-24 13:55:18,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:18,012 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-24 13:55:18,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 13:55:18,013 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-24 13:55:18,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:18,014 INFO L225 Difference]: With dead ends: 101 [2018-12-24 13:55:18,014 INFO L226 Difference]: Without dead ends: 99 [2018-12-24 13:55:18,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:55:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-24 13:55:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-24 13:55:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-24 13:55:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-24 13:55:18,018 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-24 13:55:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:18,019 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-24 13:55:18,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-24 13:55:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-24 13:55:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-24 13:55:18,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:18,020 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-24 13:55:18,020 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:18,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-24 13:55:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:18,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:18,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:21,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:21,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:21,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:21,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:21,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:21,524 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 [2018-12-24 13:55:21,534 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:21,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:23,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-24 13:55:23,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:23,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:23,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:33,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:33,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-24 13:55:33,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:33,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 13:55:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 13:55:33,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:55:33,615 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-24 13:55:33,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:33,784 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-24 13:55:33,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 13:55:33,784 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-24 13:55:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:33,785 INFO L225 Difference]: With dead ends: 102 [2018-12-24 13:55:33,785 INFO L226 Difference]: Without dead ends: 100 [2018-12-24 13:55:33,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:55:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-24 13:55:33,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-24 13:55:33,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 13:55:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-24 13:55:33,788 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-24 13:55:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:33,789 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-24 13:55:33,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 13:55:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-24 13:55:33,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-24 13:55:33,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:33,789 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-24 13:55:33,790 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:33,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:33,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-24 13:55:33,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:33,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:33,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:33,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:37,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:37,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:37,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:37,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:37,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:37,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 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 [2018-12-24 13:55:37,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:37,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:37,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:37,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:37,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:37,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:47,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:47,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-24 13:55:47,901 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:47,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-24 13:55:47,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-24 13:55:47,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:55:47,903 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-24 13:55:48,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:48,124 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-24 13:55:48,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 13:55:48,124 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-24 13:55:48,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:48,125 INFO L225 Difference]: With dead ends: 103 [2018-12-24 13:55:48,125 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 13:55:48,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:55:48,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 13:55:48,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-24 13:55:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 13:55:48,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-24 13:55:48,128 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-24 13:55:48,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:48,129 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-24 13:55:48,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-24 13:55:48,129 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-24 13:55:48,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 13:55:48,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:48,129 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-24 13:55:48,129 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:48,130 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-24 13:55:48,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:48,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:48,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:48,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:51,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:51,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:51,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:51,681 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:51,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:51,681 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 [2018-12-24 13:55:51,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:51,689 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:51,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:51,799 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:02,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:02,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-24 13:56:02,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:02,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 13:56:02,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 13:56:02,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:56:02,706 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-24 13:56:03,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:03,005 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-24 13:56:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 13:56:03,005 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-24 13:56:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:03,006 INFO L225 Difference]: With dead ends: 104 [2018-12-24 13:56:03,006 INFO L226 Difference]: Without dead ends: 102 [2018-12-24 13:56:03,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:56:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-24 13:56:03,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-24 13:56:03,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-24 13:56:03,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-24 13:56:03,010 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-24 13:56:03,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:03,010 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-24 13:56:03,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 13:56:03,010 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-24 13:56:03,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-24 13:56:03,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:03,011 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-24 13:56:03,011 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:03,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:03,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-24 13:56:03,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:03,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:03,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:03,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:06,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:06,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:06,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:06,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:06,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:06,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:06,533 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 [2018-12-24 13:56:06,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:06,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:08,608 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-24 13:56:08,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:08,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:08,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:08,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:19,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:19,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-24 13:56:19,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:19,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-24 13:56:19,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-24 13:56:19,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:56:19,517 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-24 13:56:19,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:19,762 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-24 13:56:19,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 13:56:19,762 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-24 13:56:19,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:19,762 INFO L225 Difference]: With dead ends: 105 [2018-12-24 13:56:19,763 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 13:56:19,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:56:19,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 13:56:19,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-24 13:56:19,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 13:56:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-24 13:56:19,766 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-24 13:56:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:19,766 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-24 13:56:19,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-24 13:56:19,766 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-24 13:56:19,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 13:56:19,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:19,766 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-24 13:56:19,767 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:19,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-24 13:56:19,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:19,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:19,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:19,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:23,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:23,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:23,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:23,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:23,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:23,582 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 [2018-12-24 13:56:23,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:23,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:23,682 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:23,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:23,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:23,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:23,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:34,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-24 13:56:34,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:34,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 13:56:34,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 13:56:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:56:34,876 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-24 13:56:35,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:35,148 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-24 13:56:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-24 13:56:35,148 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-24 13:56:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:35,149 INFO L225 Difference]: With dead ends: 106 [2018-12-24 13:56:35,149 INFO L226 Difference]: Without dead ends: 104 [2018-12-24 13:56:35,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:56:35,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-24 13:56:35,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-24 13:56:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-24 13:56:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-24 13:56:35,152 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-24 13:56:35,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:35,152 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-24 13:56:35,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 13:56:35,153 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-24 13:56:35,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-24 13:56:35,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:35,153 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-24 13:56:35,153 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:35,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:35,154 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-24 13:56:35,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:35,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:35,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:35,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:39,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:39,115 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:39,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:39,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:39,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:39,116 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 [2018-12-24 13:56:39,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:39,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:39,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:39,241 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:39,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:50,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:50,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-24 13:56:50,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:50,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-24 13:56:50,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-24 13:56:50,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 13:56:50,448 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-24 13:56:50,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:50,625 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-24 13:56:50,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 13:56:50,625 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-24 13:56:50,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:50,626 INFO L225 Difference]: With dead ends: 107 [2018-12-24 13:56:50,626 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 13:56:50,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 13:56:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 13:56:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-24 13:56:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 13:56:50,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-24 13:56:50,630 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-24 13:56:50,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:50,631 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-24 13:56:50,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-24 13:56:50,631 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-24 13:56:50,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 13:56:50,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:50,632 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-24 13:56:50,632 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:50,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:50,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-24 13:56:50,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:50,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:50,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:50,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:54,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:54,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:54,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:54,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:54,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:54,630 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 [2018-12-24 13:56:54,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:54,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:57,042 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-24 13:56:57,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:57,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:57,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:08,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:08,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-24 13:57:08,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:08,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 13:57:08,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 13:57:08,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 13:57:08,690 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-24 13:57:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:09,040 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-24 13:57:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-24 13:57:09,040 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-24 13:57:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:09,041 INFO L225 Difference]: With dead ends: 108 [2018-12-24 13:57:09,041 INFO L226 Difference]: Without dead ends: 106 [2018-12-24 13:57:09,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 13:57:09,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-24 13:57:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-24 13:57:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-24 13:57:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-24 13:57:09,045 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-24 13:57:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:09,046 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-24 13:57:09,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 13:57:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-24 13:57:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-24 13:57:09,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:09,047 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-24 13:57:09,047 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:09,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:09,047 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-24 13:57:09,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:09,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:09,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:09,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:09,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:12,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:12,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:12,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:12,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:12,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:12,908 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 [2018-12-24 13:57:12,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:12,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:13,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:13,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:13,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:13,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:24,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-24 13:57:24,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:24,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-24 13:57:24,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-24 13:57:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 13:57:24,917 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-24 13:57:25,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:25,219 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-24 13:57:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-24 13:57:25,219 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-24 13:57:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:25,220 INFO L225 Difference]: With dead ends: 109 [2018-12-24 13:57:25,220 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 13:57:25,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 13:57:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 13:57:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-24 13:57:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-24 13:57:25,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-24 13:57:25,223 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-24 13:57:25,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:25,224 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-24 13:57:25,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-24 13:57:25,224 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-24 13:57:25,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-24 13:57:25,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:25,225 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-24 13:57:25,225 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:25,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:25,225 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-24 13:57:25,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:25,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:25,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:25,226 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:29,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:29,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:29,409 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:29,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:29,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:29,410 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 [2018-12-24 13:57:29,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:29,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:29,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:29,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:29,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:41,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:41,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:41,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-24 13:57:41,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:41,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 13:57:41,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 13:57:41,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 13:57:41,620 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-24 13:57:41,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:41,874 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-24 13:57:41,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-24 13:57:41,875 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-24 13:57:41,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:41,875 INFO L225 Difference]: With dead ends: 110 [2018-12-24 13:57:41,875 INFO L226 Difference]: Without dead ends: 108 [2018-12-24 13:57:41,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 13:57:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-24 13:57:41,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-24 13:57:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-24 13:57:41,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-24 13:57:41,880 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-24 13:57:41,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:41,880 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-24 13:57:41,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 13:57:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-24 13:57:41,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-24 13:57:41,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:41,881 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-24 13:57:41,881 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:41,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:41,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-24 13:57:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:41,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:41,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:41,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:46,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:46,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:46,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:46,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:46,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:46,154 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 [2018-12-24 13:57:46,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:46,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:48,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-24 13:57:48,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:48,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:48,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:01,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-24 13:58:01,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:01,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-24 13:58:01,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-24 13:58:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-24 13:58:01,244 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-24 13:58:01,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:01,484 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-24 13:58:01,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-24 13:58:01,484 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-24 13:58:01,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:01,484 INFO L225 Difference]: With dead ends: 111 [2018-12-24 13:58:01,484 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 13:58:01,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-24 13:58:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 13:58:01,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-24 13:58:01,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 13:58:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-24 13:58:01,487 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-24 13:58:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:01,488 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-24 13:58:01,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-24 13:58:01,488 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-24 13:58:01,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 13:58:01,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:01,488 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-24 13:58:01,488 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:01,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:01,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-24 13:58:01,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:01,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:01,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:01,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:05,690 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:05,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:05,690 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:05,690 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:05,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:05,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:05,691 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 [2018-12-24 13:58:05,699 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:05,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:05,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:05,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:05,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:05,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:18,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:18,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:18,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-24 13:58:18,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:18,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 13:58:18,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 13:58:18,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 13:58:18,038 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-24 13:58:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:18,284 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-24 13:58:18,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-24 13:58:18,284 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-24 13:58:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:18,285 INFO L225 Difference]: With dead ends: 112 [2018-12-24 13:58:18,285 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 13:58:18,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-24 13:58:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 13:58:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-24 13:58:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-24 13:58:18,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-24 13:58:18,288 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-24 13:58:18,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:18,288 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-24 13:58:18,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 13:58:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-24 13:58:18,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-24 13:58:18,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:18,289 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-24 13:58:18,289 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:18,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:18,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-24 13:58:18,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:18,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:18,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:18,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:22,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:22,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:22,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:22,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:22,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:22,722 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 [2018-12-24 13:58:22,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:22,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:22,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:22,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:35,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:35,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:35,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-24 13:58:35,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:35,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-24 13:58:35,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-24 13:58:35,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-24 13:58:35,346 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-24 13:58:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:35,648 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-24 13:58:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-24 13:58:35,648 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-24 13:58:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:35,648 INFO L225 Difference]: With dead ends: 113 [2018-12-24 13:58:35,648 INFO L226 Difference]: Without dead ends: 111 [2018-12-24 13:58:35,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-24 13:58:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-24 13:58:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-24 13:58:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 13:58:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-24 13:58:35,652 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-24 13:58:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:35,652 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-24 13:58:35,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-24 13:58:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-24 13:58:35,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-24 13:58:35,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:35,653 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-24 13:58:35,653 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:35,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-24 13:58:35,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:35,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:35,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:35,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:39,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:39,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:39,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:39,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:39,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:39,874 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 [2018-12-24 13:58:39,882 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:58:39,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:58:43,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-24 13:58:43,052 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:43,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:43,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:56,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:56,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:56,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-24 13:58:56,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:56,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 13:58:56,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 13:58:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-24 13:58:56,097 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-24 13:58:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:56,481 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-24 13:58:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-24 13:58:56,482 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-24 13:58:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:56,482 INFO L225 Difference]: With dead ends: 114 [2018-12-24 13:58:56,482 INFO L226 Difference]: Without dead ends: 112 [2018-12-24 13:58:56,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-24 13:58:56,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-24 13:58:56,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-24 13:58:56,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-24 13:58:56,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-24 13:58:56,485 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-24 13:58:56,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:56,486 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-24 13:58:56,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 13:58:56,486 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-24 13:58:56,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-24 13:58:56,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:56,486 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-24 13:58:56,486 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:56,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:56,487 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-24 13:58:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:56,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:56,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:56,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:00,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:00,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:00,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:00,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:00,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:00,758 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 [2018-12-24 13:59:00,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:59:00,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:59:00,866 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:59:00,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:00,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:00,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:14,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:14,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-24 13:59:14,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:14,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-24 13:59:14,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-24 13:59:14,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-24 13:59:14,202 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-24 13:59:14,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:14,470 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-24 13:59:14,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-24 13:59:14,471 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-24 13:59:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:14,471 INFO L225 Difference]: With dead ends: 115 [2018-12-24 13:59:14,472 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 13:59:14,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-24 13:59:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 13:59:14,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-24 13:59:14,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 13:59:14,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-24 13:59:14,476 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-24 13:59:14,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:14,476 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-24 13:59:14,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-24 13:59:14,476 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-24 13:59:14,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 13:59:14,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:14,477 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-24 13:59:14,477 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:14,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:14,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-24 13:59:14,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:14,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:14,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:14,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:19,140 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:19,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:19,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:19,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:19,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:19,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:19,141 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 [2018-12-24 13:59:19,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:19,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:19,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:19,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:32,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:32,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:32,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-24 13:59:32,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:32,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 13:59:32,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 13:59:32,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-24 13:59:32,809 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states.