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/toy/tooDifficultLoopInvariant/PointerIncrement.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:01:03,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:01:03,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:01:03,948 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:01:03,949 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:01:03,950 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:01:03,951 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:01:03,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:01:03,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:01:03,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:01:03,957 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:01:03,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:01:03,958 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:01:03,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:01:03,963 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:01:03,964 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:01:03,965 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:01:03,967 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:01:03,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:01:03,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:01:03,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:01:03,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:01:03,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:01:03,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:01:03,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:01:03,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:01:03,976 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:01:03,977 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:01:03,977 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:01:03,978 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:01:03,979 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:01:03,979 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:01:03,979 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:01:03,980 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:01:03,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:01:03,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:01:03,982 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-11 11:01:03,993 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:01:03,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:01:03,994 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:01:03,994 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:01:03,994 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:01:03,994 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:01:03,995 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:01:03,995 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:01:03,995 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:01:03,995 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:01:03,995 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:01:03,996 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:01:03,996 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:01:03,996 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:01:03,997 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:01:03,997 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:01:03,997 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:01:03,997 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:01:03,997 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:01:03,998 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:01:03,998 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:01:03,998 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:01:03,998 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:01:03,998 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:01:03,999 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:01:03,999 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:01:03,999 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:01:03,999 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:01:03,999 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:01:04,000 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:01:04,000 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:01:04,000 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:01:04,000 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:01:04,000 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:01:04,001 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:01:04,001 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:01:04,001 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:01:04,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:01:04,001 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:01:04,001 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:01:04,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:01:04,067 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:01:04,073 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:01:04,074 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:01:04,074 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:01:04,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl [2019-01-11 11:01:04,075 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement.bpl' [2019-01-11 11:01:04,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:01:04,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:01:04,114 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:04,114 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:01:04,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:01:04,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,143 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:01:04,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:01:04,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:01:04,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:01:04,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,201 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/1) ... [2019-01-11 11:01:04,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:01:04,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:01:04,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:01:04,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:01:04,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 11:01:04,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:01:04,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:01:04,688 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:01:04,689 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-11 11:01:04,690 INFO L202 PluginConnector]: Adding new model PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:04 BoogieIcfgContainer [2019-01-11 11:01:04,690 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:01:04,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 11:01:04,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 11:01:04,695 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 11:01:04,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:01:04" (1/2) ... [2019-01-11 11:01:04,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e59c8ad and model type PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 11:01:04, skipping insertion in model container [2019-01-11 11:01:04,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:01:04" (2/2) ... [2019-01-11 11:01:04,700 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement.bpl [2019-01-11 11:01:04,709 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 11:01:04,716 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-11 11:01:04,732 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-11 11:01:04,764 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 11:01:04,764 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 11:01:04,764 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 11:01:04,764 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 11:01:04,764 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 11:01:04,765 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 11:01:04,765 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 11:01:04,765 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 11:01:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-11 11:01:04,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 11:01:04,784 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:04,785 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 11:01:04,788 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:04,794 INFO L82 PathProgramCache]: Analyzing trace with hash 28694788, now seen corresponding path program 1 times [2019-01-11 11:01:04,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:04,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:04,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:04,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:05,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:05,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:05,010 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:05,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:01:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:01:05,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:01:05,031 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 4 states. [2019-01-11 11:01:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:05,181 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2019-01-11 11:01:05,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 11:01:05,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 11:01:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:05,196 INFO L225 Difference]: With dead ends: 24 [2019-01-11 11:01:05,197 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 11:01:05,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:01:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 11:01:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2019-01-11 11:01:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-11 11:01:05,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-11 11:01:05,229 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2019-01-11 11:01:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:05,229 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-11 11:01:05,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:01:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-11 11:01:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 11:01:05,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:05,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 11:01:05,230 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:05,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:05,231 INFO L82 PathProgramCache]: Analyzing trace with hash 889538471, now seen corresponding path program 1 times [2019-01-11 11:01:05,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:05,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:05,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:05,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:05,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:05,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:05,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 11:01:05,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 11:01:05,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 11:01:05,389 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2019-01-11 11:01:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:05,584 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-11 11:01:05,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 11:01:05,585 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 11:01:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:05,586 INFO L225 Difference]: With dead ends: 18 [2019-01-11 11:01:05,586 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 11:01:05,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 11:01:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 11:01:05,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-01-11 11:01:05,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:01:05,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2019-01-11 11:01:05,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 6 [2019-01-11 11:01:05,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:05,593 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2019-01-11 11:01:05,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 11:01:05,593 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2019-01-11 11:01:05,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-11 11:01:05,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:05,594 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-11 11:01:05,595 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:05,595 INFO L82 PathProgramCache]: Analyzing trace with hash 473213613, now seen corresponding path program 1 times [2019-01-11 11:01:05,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:05,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 11:01:05,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 11:01:05,651 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 11:01:05,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 11:01:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 11:01:05,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:05,652 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 3 states. [2019-01-11 11:01:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:05,683 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-11 11:01:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 11:01:05,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-11 11:01:05,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:05,685 INFO L225 Difference]: With dead ends: 19 [2019-01-11 11:01:05,685 INFO L226 Difference]: Without dead ends: 12 [2019-01-11 11:01:05,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 11:01:05,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-11 11:01:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-11 11:01:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-11 11:01:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-11 11:01:05,690 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-01-11 11:01:05,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:05,690 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-11 11:01:05,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 11:01:05,691 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-11 11:01:05,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-11 11:01:05,691 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:05,691 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2019-01-11 11:01:05,692 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:05,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:05,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1846021201, now seen corresponding path program 1 times [2019-01-11 11:01:05,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:05,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:05,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:05,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:05,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:05,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:05,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2019-01-11 11:01:05,946 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [9], [11], [12], [13], [21] [2019-01-11 11:01:05,987 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 11:01:05,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:01:06,216 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:01:06,221 INFO L272 AbstractInterpreter]: Visited 8 different actions 26 times. Merged at 6 different actions 18 times. Never widened. Performed 252 root evaluator evaluations with a maximum evaluation depth of 3. Performed 252 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-11 11:01:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 11:01:06,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:06,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:06,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:06,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:06,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:06,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:06,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:06,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:06,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:06,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:06,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:06,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:06,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 11:01:06,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:06,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 11:01:06,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 11:01:06,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2019-01-11 11:01:06,706 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 8 states. [2019-01-11 11:01:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:06,897 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-11 11:01:06,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 11:01:06,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-01-11 11:01:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:06,899 INFO L225 Difference]: With dead ends: 21 [2019-01-11 11:01:06,899 INFO L226 Difference]: Without dead ends: 20 [2019-01-11 11:01:06,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-11 11:01:06,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-11 11:01:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-11 11:01:06,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 11:01:06,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-11 11:01:06,905 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2019-01-11 11:01:06,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:06,906 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-11 11:01:06,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 11:01:06,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-11 11:01:06,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 11:01:06,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:06,907 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1] [2019-01-11 11:01:06,907 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:06,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:06,908 INFO L82 PathProgramCache]: Analyzing trace with hash 506962407, now seen corresponding path program 2 times [2019-01-11 11:01:06,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:06,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:06,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:06,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:07,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:07,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:07,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:07,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:07,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:07,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:07,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:07,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 11:01:07,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:07,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:07,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:07,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:07,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:07,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:07,755 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:07,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:07,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2019-01-11 11:01:07,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:07,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 11:01:07,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 11:01:07,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-11 11:01:07,778 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 10 states. [2019-01-11 11:01:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:07,930 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-11 11:01:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 11:01:07,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2019-01-11 11:01:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:07,932 INFO L225 Difference]: With dead ends: 26 [2019-01-11 11:01:07,932 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 11:01:07,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 11:01:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2019-01-11 11:01:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-11 11:01:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-11 11:01:07,938 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2019-01-11 11:01:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:07,939 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-11 11:01:07,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 11:01:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-11 11:01:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-11 11:01:07,940 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:07,940 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1] [2019-01-11 11:01:07,940 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:07,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:07,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1970543121, now seen corresponding path program 3 times [2019-01-11 11:01:07,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:07,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:07,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,096 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:08,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:08,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:08,108 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:08,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:08,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:08,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:08,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:08,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:08,277 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:08,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2019-01-11 11:01:08,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:08,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 11:01:08,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 11:01:08,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-11 11:01:08,520 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2019-01-11 11:01:08,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:08,756 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-11 11:01:08,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 11:01:08,758 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-01-11 11:01:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:08,759 INFO L225 Difference]: With dead ends: 31 [2019-01-11 11:01:08,760 INFO L226 Difference]: Without dead ends: 30 [2019-01-11 11:01:08,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2019-01-11 11:01:08,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-11 11:01:08,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-11 11:01:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 11:01:08,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-11 11:01:08,767 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2019-01-11 11:01:08,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:08,767 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-11 11:01:08,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 11:01:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-11 11:01:08,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 11:01:08,768 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:08,768 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1] [2019-01-11 11:01:08,768 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:08,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:08,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1357786151, now seen corresponding path program 4 times [2019-01-11 11:01:08,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:08,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:08,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:08,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:08,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:08,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:08,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:08,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:08,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:08,928 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:08,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:08,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:08,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:08,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:09,103 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:09,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2019-01-11 11:01:09,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:09,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 11:01:09,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 11:01:09,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=241, Unknown=0, NotChecked=0, Total=380 [2019-01-11 11:01:09,238 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2019-01-11 11:01:09,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:09,453 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-11 11:01:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 11:01:09,456 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-11 11:01:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:09,457 INFO L225 Difference]: With dead ends: 36 [2019-01-11 11:01:09,458 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 11:01:09,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=229, Invalid=371, Unknown=0, NotChecked=0, Total=600 [2019-01-11 11:01:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 11:01:09,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-11 11:01:09,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-11 11:01:09,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-11 11:01:09,466 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2019-01-11 11:01:09,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:09,466 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-11 11:01:09,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 11:01:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-11 11:01:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-11 11:01:09,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:09,468 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1] [2019-01-11 11:01:09,468 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:09,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1853487057, now seen corresponding path program 5 times [2019-01-11 11:01:09,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:09,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:09,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:09,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:09,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:09,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:09,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:09,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:09,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:09,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:09,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:09,680 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-11 11:01:09,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:09,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:09,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:09,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:09,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:09,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:09,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:10,007 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:10,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2019-01-11 11:01:10,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:10,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 11:01:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 11:01:10,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=317, Unknown=0, NotChecked=0, Total=506 [2019-01-11 11:01:10,029 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 16 states. [2019-01-11 11:01:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:10,469 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-11 11:01:10,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 11:01:10,470 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 31 [2019-01-11 11:01:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:10,471 INFO L225 Difference]: With dead ends: 41 [2019-01-11 11:01:10,471 INFO L226 Difference]: Without dead ends: 40 [2019-01-11 11:01:10,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=312, Invalid=500, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:10,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-11 11:01:10,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-11 11:01:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 11:01:10,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-11 11:01:10,479 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2019-01-11 11:01:10,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:10,479 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-11 11:01:10,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 11:01:10,479 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-11 11:01:10,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 11:01:10,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:10,480 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1] [2019-01-11 11:01:10,480 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:10,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1716722073, now seen corresponding path program 6 times [2019-01-11 11:01:10,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:10,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,482 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:10,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:10,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:10,688 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:10,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:10,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:10,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:10,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:10,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:10,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:10,699 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:10,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:10,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:10,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:10,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:10,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:10,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:11,859 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:11,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:11,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2019-01-11 11:01:11,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:11,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 11:01:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 11:01:11,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=403, Unknown=0, NotChecked=0, Total=650 [2019-01-11 11:01:11,880 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2019-01-11 11:01:12,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:12,363 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-11 11:01:12,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 11:01:12,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2019-01-11 11:01:12,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:12,364 INFO L225 Difference]: With dead ends: 46 [2019-01-11 11:01:12,364 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 11:01:12,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=408, Invalid=648, Unknown=0, NotChecked=0, Total=1056 [2019-01-11 11:01:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 11:01:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2019-01-11 11:01:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 11:01:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-11 11:01:12,371 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2019-01-11 11:01:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:12,371 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-11 11:01:12,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 11:01:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-11 11:01:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-11 11:01:12,372 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:12,372 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1] [2019-01-11 11:01:12,373 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:12,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1089100399, now seen corresponding path program 7 times [2019-01-11 11:01:12,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:12,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:12,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:12,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:12,682 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:12,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:12,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:12,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:12,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:12,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:12,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:12,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:12,693 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:12,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:12,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:12,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:12,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:12,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:13,028 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:13,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2019-01-11 11:01:13,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:13,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 11:01:13,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 11:01:13,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=499, Unknown=0, NotChecked=0, Total=812 [2019-01-11 11:01:13,222 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 20 states. [2019-01-11 11:01:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:13,512 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-11 11:01:13,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 11:01:13,513 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-01-11 11:01:13,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:13,514 INFO L225 Difference]: With dead ends: 51 [2019-01-11 11:01:13,514 INFO L226 Difference]: Without dead ends: 50 [2019-01-11 11:01:13,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=517, Invalid=815, Unknown=0, NotChecked=0, Total=1332 [2019-01-11 11:01:13,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-11 11:01:13,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2019-01-11 11:01:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 11:01:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-11 11:01:13,523 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2019-01-11 11:01:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:13,523 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-11 11:01:13,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 11:01:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-11 11:01:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 11:01:13,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:13,525 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1] [2019-01-11 11:01:13,525 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash -268971865, now seen corresponding path program 8 times [2019-01-11 11:01:13,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:13,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:13,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:13,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:13,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:13,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:13,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:13,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:13,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:13,720 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:13,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-11 11:01:13,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:13,767 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:13,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:13,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:13,783 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:14,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:14,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:14,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2019-01-11 11:01:14,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:14,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 11:01:14,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 11:01:14,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=387, Invalid=605, Unknown=0, NotChecked=0, Total=992 [2019-01-11 11:01:14,283 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 22 states. [2019-01-11 11:01:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:14,659 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-11 11:01:14,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 11:01:14,660 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2019-01-11 11:01:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:14,662 INFO L225 Difference]: With dead ends: 56 [2019-01-11 11:01:14,662 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 11:01:14,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=639, Invalid=1001, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:01:14,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 11:01:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-11 11:01:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-11 11:01:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-11 11:01:14,670 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2019-01-11 11:01:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:14,670 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-11 11:01:14,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 11:01:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-11 11:01:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-11 11:01:14,671 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:14,671 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1] [2019-01-11 11:01:14,672 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash -2109529263, now seen corresponding path program 9 times [2019-01-11 11:01:14,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:14,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:14,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:14,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:15,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:15,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:15,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:15,036 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:15,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:15,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:15,098 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:15,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:15,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:15,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:15,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:15,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:15,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:15,272 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:15,455 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:15,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:15,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2019-01-11 11:01:15,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:15,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 11:01:15,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 11:01:15,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=721, Unknown=0, NotChecked=0, Total=1190 [2019-01-11 11:01:15,477 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 24 states. [2019-01-11 11:01:15,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:15,926 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-11 11:01:15,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 11:01:15,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 51 [2019-01-11 11:01:15,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:15,927 INFO L225 Difference]: With dead ends: 61 [2019-01-11 11:01:15,927 INFO L226 Difference]: Without dead ends: 60 [2019-01-11 11:01:15,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 546 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=774, Invalid=1206, Unknown=0, NotChecked=0, Total=1980 [2019-01-11 11:01:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-11 11:01:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-11 11:01:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 11:01:15,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-11 11:01:15,937 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2019-01-11 11:01:15,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:15,938 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-11 11:01:15,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 11:01:15,938 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-11 11:01:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 11:01:15,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:15,939 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1] [2019-01-11 11:01:15,939 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:15,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1236079897, now seen corresponding path program 10 times [2019-01-11 11:01:15,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:15,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:15,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:15,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:16,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:16,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:16,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:16,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:16,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:16,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:16,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:16,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:16,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:16,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:16,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:16,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:17,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:17,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:17,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2019-01-11 11:01:17,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:17,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 11:01:17,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 11:01:17,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=559, Invalid=847, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 11:01:17,436 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2019-01-11 11:01:17,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:17,888 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-11 11:01:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 11:01:17,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2019-01-11 11:01:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:17,890 INFO L225 Difference]: With dead ends: 66 [2019-01-11 11:01:17,890 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 11:01:17,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 656 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=922, Invalid=1430, Unknown=0, NotChecked=0, Total=2352 [2019-01-11 11:01:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 11:01:17,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-01-11 11:01:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-11 11:01:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-11 11:01:17,903 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2019-01-11 11:01:17,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:17,903 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-11 11:01:17,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 11:01:17,904 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-11 11:01:17,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-11 11:01:17,904 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:17,905 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1] [2019-01-11 11:01:17,905 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:17,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:17,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1207857425, now seen corresponding path program 11 times [2019-01-11 11:01:17,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:17,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:17,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:17,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:18,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:18,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:18,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:18,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:18,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:18,268 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:18,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:18,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-11 11:01:18,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:18,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:18,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:18,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:18,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:18,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:18,855 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:18,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:18,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2019-01-11 11:01:18,874 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:18,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 11:01:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 11:01:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=983, Unknown=0, NotChecked=0, Total=1640 [2019-01-11 11:01:18,876 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 28 states. [2019-01-11 11:01:19,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:19,274 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-11 11:01:19,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 11:01:19,274 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 61 [2019-01-11 11:01:19,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:19,275 INFO L225 Difference]: With dead ends: 71 [2019-01-11 11:01:19,275 INFO L226 Difference]: Without dead ends: 70 [2019-01-11 11:01:19,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1083, Invalid=1673, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:01:19,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-11 11:01:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2019-01-11 11:01:19,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 11:01:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-11 11:01:19,291 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2019-01-11 11:01:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:19,291 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-11 11:01:19,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 11:01:19,291 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-11 11:01:19,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 11:01:19,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:19,293 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1] [2019-01-11 11:01:19,293 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:19,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:19,293 INFO L82 PathProgramCache]: Analyzing trace with hash -96324313, now seen corresponding path program 12 times [2019-01-11 11:01:19,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:19,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:19,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:19,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:19,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:19,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:20,178 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:20,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:20,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:20,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:20,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:20,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:20,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:20,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:20,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:20,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:20,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:20,253 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:20,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:20,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:20,847 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:20,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:21,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:21,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 43 [2019-01-11 11:01:21,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:21,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 11:01:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 11:01:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=763, Invalid=1129, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 11:01:21,718 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 30 states. [2019-01-11 11:01:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:22,310 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-11 11:01:22,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 11:01:22,310 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 66 [2019-01-11 11:01:22,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:22,311 INFO L225 Difference]: With dead ends: 76 [2019-01-11 11:01:22,311 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 11:01:22,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1257, Invalid=1935, Unknown=0, NotChecked=0, Total=3192 [2019-01-11 11:01:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 11:01:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2019-01-11 11:01:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-11 11:01:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-11 11:01:22,324 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 66 [2019-01-11 11:01:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:22,324 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-11 11:01:22,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 11:01:22,324 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-11 11:01:22,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-11 11:01:22,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:22,325 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1] [2019-01-11 11:01:22,326 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:22,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:22,326 INFO L82 PathProgramCache]: Analyzing trace with hash -716992815, now seen corresponding path program 13 times [2019-01-11 11:01:22,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:22,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:22,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:22,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:22,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:22,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:22,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:22,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:22,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:22,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:22,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:22,765 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:22,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:22,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:22,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:22,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:22,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:22,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:23,068 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:23,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:23,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2019-01-11 11:01:23,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:23,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 11:01:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 11:01:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=877, Invalid=1285, Unknown=0, NotChecked=0, Total=2162 [2019-01-11 11:01:23,407 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 32 states. [2019-01-11 11:01:23,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:23,958 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-11 11:01:23,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 11:01:23,959 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2019-01-11 11:01:23,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:23,960 INFO L225 Difference]: With dead ends: 81 [2019-01-11 11:01:23,960 INFO L226 Difference]: Without dead ends: 80 [2019-01-11 11:01:23,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1046 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1444, Invalid=2216, Unknown=0, NotChecked=0, Total=3660 [2019-01-11 11:01:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-11 11:01:23,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2019-01-11 11:01:23,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 11:01:23,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-11 11:01:23,973 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 71 [2019-01-11 11:01:23,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:23,973 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-11 11:01:23,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 11:01:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-11 11:01:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 11:01:23,974 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:23,974 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1] [2019-01-11 11:01:23,975 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:23,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:23,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1270239385, now seen corresponding path program 14 times [2019-01-11 11:01:23,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:23,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:23,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:24,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:24,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:24,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:24,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:24,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:24,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:24,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:24,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-11 11:01:24,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:24,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:24,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:24,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:24,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:24,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:24,999 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:24,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:25,499 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:25,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:25,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 49 [2019-01-11 11:01:25,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:25,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 11:01:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 11:01:25,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=999, Invalid=1451, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 11:01:25,520 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 34 states. [2019-01-11 11:01:25,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:25,995 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-11 11:01:25,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 11:01:25,996 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 76 [2019-01-11 11:01:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:25,997 INFO L225 Difference]: With dead ends: 86 [2019-01-11 11:01:25,997 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 11:01:25,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1644, Invalid=2516, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:01:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 11:01:26,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2019-01-11 11:01:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-11 11:01:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-11 11:01:26,012 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 76 [2019-01-11 11:01:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:26,012 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-11 11:01:26,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 11:01:26,012 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-11 11:01:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-11 11:01:26,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:26,013 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1] [2019-01-11 11:01:26,014 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:26,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash -468812655, now seen corresponding path program 15 times [2019-01-11 11:01:26,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:26,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:26,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:26,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:26,330 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:26,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:26,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:26,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:26,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:26,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:26,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:26,339 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:26,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:26,392 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:26,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:26,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:26,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:26,414 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:26,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:26,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:26,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:27,127 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:27,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:27,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2019-01-11 11:01:27,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:27,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 11:01:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 11:01:27,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1129, Invalid=1627, Unknown=0, NotChecked=0, Total=2756 [2019-01-11 11:01:27,148 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 36 states. [2019-01-11 11:01:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:27,758 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-11 11:01:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 11:01:27,759 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 81 [2019-01-11 11:01:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:27,760 INFO L225 Difference]: With dead ends: 91 [2019-01-11 11:01:27,760 INFO L226 Difference]: Without dead ends: 90 [2019-01-11 11:01:27,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1857, Invalid=2835, Unknown=0, NotChecked=0, Total=4692 [2019-01-11 11:01:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-11 11:01:27,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2019-01-11 11:01:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 11:01:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-11 11:01:27,775 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 81 [2019-01-11 11:01:27,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:27,775 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-11 11:01:27,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 11:01:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-11 11:01:27,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 11:01:27,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:27,776 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1] [2019-01-11 11:01:27,776 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:27,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:27,777 INFO L82 PathProgramCache]: Analyzing trace with hash 132995495, now seen corresponding path program 16 times [2019-01-11 11:01:27,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:27,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:27,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:27,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:27,778 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:28,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:28,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:28,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:28,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:28,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:28,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:28,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:28,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:28,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:28,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:28,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:28,690 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:28,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:29,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:29,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 55 [2019-01-11 11:01:29,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:29,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 11:01:29,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 11:01:29,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=1813, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 11:01:29,138 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 38 states. [2019-01-11 11:01:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:29,731 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-11 11:01:29,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 11:01:29,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 86 [2019-01-11 11:01:29,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:29,732 INFO L225 Difference]: With dead ends: 96 [2019-01-11 11:01:29,732 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 11:01:29,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1526 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2083, Invalid=3173, Unknown=0, NotChecked=0, Total=5256 [2019-01-11 11:01:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 11:01:29,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2019-01-11 11:01:29,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-11 11:01:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-11 11:01:29,743 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 86 [2019-01-11 11:01:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:29,743 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-11 11:01:29,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 11:01:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-11 11:01:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-11 11:01:29,744 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:29,744 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1] [2019-01-11 11:01:29,745 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:29,745 INFO L82 PathProgramCache]: Analyzing trace with hash -480560559, now seen corresponding path program 17 times [2019-01-11 11:01:29,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:29,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:29,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:29,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:30,110 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:30,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:30,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:30,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:30,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:30,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:30,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:30,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-11 11:01:30,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:30,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:30,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:30,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:30,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:30,667 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:30,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:31,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:31,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 58 [2019-01-11 11:01:31,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:31,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 11:01:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 11:01:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1413, Invalid=2009, Unknown=0, NotChecked=0, Total=3422 [2019-01-11 11:01:31,182 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 40 states. [2019-01-11 11:01:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:31,771 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-11 11:01:31,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 11:01:31,772 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 91 [2019-01-11 11:01:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:31,773 INFO L225 Difference]: With dead ends: 101 [2019-01-11 11:01:31,773 INFO L226 Difference]: Without dead ends: 100 [2019-01-11 11:01:31,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1706 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2322, Invalid=3530, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:01:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-11 11:01:31,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2019-01-11 11:01:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 11:01:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-11 11:01:31,785 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 91 [2019-01-11 11:01:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:31,785 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-11 11:01:31,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 11:01:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-11 11:01:31,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 11:01:31,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:31,786 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1] [2019-01-11 11:01:31,787 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:31,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:31,787 INFO L82 PathProgramCache]: Analyzing trace with hash -2085538841, now seen corresponding path program 18 times [2019-01-11 11:01:31,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:31,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:31,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:31,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:32,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:32,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:32,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:32,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:32,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:32,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:32,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:32,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:32,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:32,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:32,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:32,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:32,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:32,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:32,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:32,550 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:32,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:33,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:33,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 61 [2019-01-11 11:01:33,491 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:33,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 11:01:33,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 11:01:33,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=2215, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 11:01:33,493 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 42 states. [2019-01-11 11:01:34,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:34,150 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-11 11:01:34,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 11:01:34,150 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 96 [2019-01-11 11:01:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:34,151 INFO L225 Difference]: With dead ends: 106 [2019-01-11 11:01:34,151 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 11:01:34,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1896 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2574, Invalid=3906, Unknown=0, NotChecked=0, Total=6480 [2019-01-11 11:01:34,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 11:01:34,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2019-01-11 11:01:34,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 11:01:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-11 11:01:34,164 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 96 [2019-01-11 11:01:34,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:34,164 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-11 11:01:34,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 11:01:34,164 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-11 11:01:34,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-11 11:01:34,165 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:34,165 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1] [2019-01-11 11:01:34,165 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:34,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:34,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1222260719, now seen corresponding path program 19 times [2019-01-11 11:01:34,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:34,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:34,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:34,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:34,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:35,089 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:35,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:35,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:35,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:35,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:35,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:35,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:35,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:35,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:35,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:35,173 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:35,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:35,185 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:35,636 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:36,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:36,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 64 [2019-01-11 11:01:36,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:36,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 11:01:36,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 11:01:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1729, Invalid=2431, Unknown=0, NotChecked=0, Total=4160 [2019-01-11 11:01:36,250 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 44 states. [2019-01-11 11:01:36,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:36,969 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-11 11:01:36,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 11:01:36,970 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 101 [2019-01-11 11:01:36,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:36,971 INFO L225 Difference]: With dead ends: 111 [2019-01-11 11:01:36,971 INFO L226 Difference]: Without dead ends: 110 [2019-01-11 11:01:36,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2839, Invalid=4301, Unknown=0, NotChecked=0, Total=7140 [2019-01-11 11:01:36,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-11 11:01:36,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2019-01-11 11:01:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 11:01:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-11 11:01:36,984 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 101 [2019-01-11 11:01:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:36,984 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-11 11:01:36,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 11:01:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-11 11:01:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 11:01:36,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:36,985 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1] [2019-01-11 11:01:36,985 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:36,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1629044263, now seen corresponding path program 20 times [2019-01-11 11:01:36,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:36,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:36,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:36,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:36,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:37,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:37,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:37,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:37,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:37,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:37,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:37,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:37,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:37,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:37,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-11 11:01:37,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:37,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:37,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:37,710 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:37,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:37,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:38,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:39,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:39,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:39,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 67 [2019-01-11 11:01:39,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:39,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 11:01:39,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 11:01:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1899, Invalid=2657, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 11:01:39,068 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 46 states. [2019-01-11 11:01:39,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:39,887 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-11 11:01:39,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 11:01:39,888 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 106 [2019-01-11 11:01:39,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:39,889 INFO L225 Difference]: With dead ends: 116 [2019-01-11 11:01:39,889 INFO L226 Difference]: Without dead ends: 115 [2019-01-11 11:01:39,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3117, Invalid=4715, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:01:39,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-11 11:01:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-01-11 11:01:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-11 11:01:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-11 11:01:39,902 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 106 [2019-01-11 11:01:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:39,902 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-11 11:01:39,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 11:01:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-11 11:01:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-11 11:01:39,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:39,903 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1] [2019-01-11 11:01:39,903 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:39,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2020222417, now seen corresponding path program 21 times [2019-01-11 11:01:39,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:39,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:39,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:39,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:40,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:40,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:40,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:40,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:40,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:40,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:40,391 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:40,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:40,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:40,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:40,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:40,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:40,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:40,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:40,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:41,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:41,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:41,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:41,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:41,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 70 [2019-01-11 11:01:41,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:41,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 11:01:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 11:01:41,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=2893, Unknown=0, NotChecked=0, Total=4970 [2019-01-11 11:01:41,831 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 48 states. [2019-01-11 11:01:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:42,685 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2019-01-11 11:01:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 11:01:42,686 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 111 [2019-01-11 11:01:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:42,687 INFO L225 Difference]: With dead ends: 121 [2019-01-11 11:01:42,687 INFO L226 Difference]: Without dead ends: 120 [2019-01-11 11:01:42,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2526 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3408, Invalid=5148, Unknown=0, NotChecked=0, Total=8556 [2019-01-11 11:01:42,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-11 11:01:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-01-11 11:01:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-11 11:01:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2019-01-11 11:01:42,707 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 111 [2019-01-11 11:01:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:42,707 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2019-01-11 11:01:42,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 11:01:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2019-01-11 11:01:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-11 11:01:42,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:42,708 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1] [2019-01-11 11:01:42,709 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:42,709 INFO L82 PathProgramCache]: Analyzing trace with hash -995526553, now seen corresponding path program 22 times [2019-01-11 11:01:42,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:42,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:42,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:42,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:43,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:43,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:43,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:43,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:43,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:43,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:43,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:43,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:43,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:43,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:43,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:43,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:43,631 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:44,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:44,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:44,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:44,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2019-01-11 11:01:44,933 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:44,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 11:01:44,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 11:01:44,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2263, Invalid=3139, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 11:01:44,935 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 50 states. [2019-01-11 11:01:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:45,984 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-01-11 11:01:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 11:01:45,984 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 116 [2019-01-11 11:01:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:45,985 INFO L225 Difference]: With dead ends: 126 [2019-01-11 11:01:45,985 INFO L226 Difference]: Without dead ends: 125 [2019-01-11 11:01:45,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2756 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3712, Invalid=5600, Unknown=0, NotChecked=0, Total=9312 [2019-01-11 11:01:45,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-11 11:01:45,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2019-01-11 11:01:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-11 11:01:45,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-01-11 11:01:45,999 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 116 [2019-01-11 11:01:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:45,999 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-01-11 11:01:46,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 11:01:46,000 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-01-11 11:01:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-01-11 11:01:46,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:46,001 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1] [2019-01-11 11:01:46,001 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:46,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:46,001 INFO L82 PathProgramCache]: Analyzing trace with hash 891573137, now seen corresponding path program 23 times [2019-01-11 11:01:46,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:46,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:46,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:46,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:46,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:46,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:46,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:46,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:46,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:46,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:46,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:46,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-11 11:01:46,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:46,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:46,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:46,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:46,673 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:46,673 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:47,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:48,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 76 [2019-01-11 11:01:48,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:48,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 11:01:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 11:01:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2457, Invalid=3395, Unknown=0, NotChecked=0, Total=5852 [2019-01-11 11:01:48,073 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 52 states. [2019-01-11 11:01:49,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:49,067 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2019-01-11 11:01:49,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 11:01:49,067 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 121 [2019-01-11 11:01:49,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:49,068 INFO L225 Difference]: With dead ends: 131 [2019-01-11 11:01:49,068 INFO L226 Difference]: Without dead ends: 130 [2019-01-11 11:01:49,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4029, Invalid=6071, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:01:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-11 11:01:49,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2019-01-11 11:01:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-11 11:01:49,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-01-11 11:01:49,084 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 121 [2019-01-11 11:01:49,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:49,084 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-01-11 11:01:49,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 11:01:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-01-11 11:01:49,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-11 11:01:49,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:49,085 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1] [2019-01-11 11:01:49,085 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:49,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:49,086 INFO L82 PathProgramCache]: Analyzing trace with hash -35265881, now seen corresponding path program 24 times [2019-01-11 11:01:49,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:49,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:49,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:49,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:49,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:49,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:49,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:49,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:49,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:49,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:49,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:49,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:49,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:01:49,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:01:49,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:01:49,764 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:49,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:49,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:49,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:49,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:49,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:50,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:50,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:51,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:51,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 79 [2019-01-11 11:01:51,283 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:51,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 11:01:51,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 11:01:51,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2659, Invalid=3661, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 11:01:51,284 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 54 states. [2019-01-11 11:01:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:52,303 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-01-11 11:01:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 11:01:52,303 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 126 [2019-01-11 11:01:52,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:52,304 INFO L225 Difference]: With dead ends: 136 [2019-01-11 11:01:52,304 INFO L226 Difference]: Without dead ends: 135 [2019-01-11 11:01:52,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3246 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4359, Invalid=6561, Unknown=0, NotChecked=0, Total=10920 [2019-01-11 11:01:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-11 11:01:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2019-01-11 11:01:52,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-11 11:01:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-01-11 11:01:52,326 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 126 [2019-01-11 11:01:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:52,326 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-01-11 11:01:52,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 11:01:52,326 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-01-11 11:01:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-01-11 11:01:52,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:52,327 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1] [2019-01-11 11:01:52,327 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:52,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1336913583, now seen corresponding path program 25 times [2019-01-11 11:01:52,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:52,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:01:52,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:52,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:52,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:52,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:52,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:52,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:52,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:52,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:52,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:52,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:52,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:01:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:52,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:53,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:53,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:53,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:53,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:53,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 82 [2019-01-11 11:01:54,895 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:54,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-11 11:01:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-11 11:01:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3937, Unknown=0, NotChecked=0, Total=6806 [2019-01-11 11:01:54,896 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 56 states. [2019-01-11 11:01:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:01:55,856 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-01-11 11:01:55,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 11:01:55,856 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 131 [2019-01-11 11:01:55,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:01:55,857 INFO L225 Difference]: With dead ends: 141 [2019-01-11 11:01:55,857 INFO L226 Difference]: Without dead ends: 140 [2019-01-11 11:01:55,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4702, Invalid=7070, Unknown=0, NotChecked=0, Total=11772 [2019-01-11 11:01:55,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-11 11:01:55,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-01-11 11:01:55,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-11 11:01:55,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2019-01-11 11:01:55,880 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 131 [2019-01-11 11:01:55,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:01:55,881 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2019-01-11 11:01:55,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-11 11:01:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2019-01-11 11:01:55,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-11 11:01:55,882 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:01:55,882 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1] [2019-01-11 11:01:55,882 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:01:55,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:01:55,883 INFO L82 PathProgramCache]: Analyzing trace with hash -950895385, now seen corresponding path program 26 times [2019-01-11 11:01:55,883 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:01:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:55,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:01:55,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:01:55,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:01:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:01:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:56,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:01:56,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:01:56,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:01:56,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:01:56,412 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:01:56,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:01:56,421 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:01:56,566 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-11 11:01:56,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:01:56,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:01:56,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:01:56,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:01:56,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:01:56,684 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:01:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:58,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:01:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:01:59,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:01:59,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 85 [2019-01-11 11:01:59,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:01:59,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-11 11:01:59,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-11 11:01:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3087, Invalid=4223, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 11:01:59,463 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 58 states. [2019-01-11 11:02:00,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:00,600 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2019-01-11 11:02:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 11:02:00,600 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 136 [2019-01-11 11:02:00,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:00,601 INFO L225 Difference]: With dead ends: 146 [2019-01-11 11:02:00,601 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 11:02:00,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3776 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5058, Invalid=7598, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:02:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 11:02:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2019-01-11 11:02:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-11 11:02:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-01-11 11:02:00,619 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 136 [2019-01-11 11:02:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:00,620 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-01-11 11:02:00,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-11 11:02:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-01-11 11:02:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-01-11 11:02:00,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:00,621 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1] [2019-01-11 11:02:00,621 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:00,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:00,622 INFO L82 PathProgramCache]: Analyzing trace with hash 568991505, now seen corresponding path program 27 times [2019-01-11 11:02:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:00,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:00,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:00,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:01,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:01,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:01,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:01,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:01,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:01,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:01,674 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:01,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:01,766 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:01,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:01,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:01,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:01,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:01,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:01,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:02,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:03,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:03,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:03,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 88 [2019-01-11 11:02:03,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:03,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-11 11:02:03,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-11 11:02:03,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3313, Invalid=4519, Unknown=0, NotChecked=0, Total=7832 [2019-01-11 11:02:03,724 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 60 states. [2019-01-11 11:02:04,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:04,883 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2019-01-11 11:02:04,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 11:02:04,884 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 141 [2019-01-11 11:02:04,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:04,885 INFO L225 Difference]: With dead ends: 151 [2019-01-11 11:02:04,885 INFO L226 Difference]: Without dead ends: 150 [2019-01-11 11:02:04,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4056 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5427, Invalid=8145, Unknown=0, NotChecked=0, Total=13572 [2019-01-11 11:02:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-11 11:02:04,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2019-01-11 11:02:04,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-11 11:02:04,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2019-01-11 11:02:04,905 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 141 [2019-01-11 11:02:04,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:04,905 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2019-01-11 11:02:04,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-11 11:02:04,906 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2019-01-11 11:02:04,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-11 11:02:04,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:04,907 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1] [2019-01-11 11:02:04,907 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:04,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:04,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2039265497, now seen corresponding path program 28 times [2019-01-11 11:02:04,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:04,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:04,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:04,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:05,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:05,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:05,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:05,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:05,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:05,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:05,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:05,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:06,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:06,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:06,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:06,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:06,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:06,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:08,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:08,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:08,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 91 [2019-01-11 11:02:08,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:08,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-11 11:02:08,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-11 11:02:08,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3547, Invalid=4825, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 11:02:08,185 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 62 states. [2019-01-11 11:02:09,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:09,551 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-01-11 11:02:09,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 11:02:09,552 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 146 [2019-01-11 11:02:09,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:09,553 INFO L225 Difference]: With dead ends: 156 [2019-01-11 11:02:09,553 INFO L226 Difference]: Without dead ends: 155 [2019-01-11 11:02:09,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5809, Invalid=8711, Unknown=0, NotChecked=0, Total=14520 [2019-01-11 11:02:09,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-11 11:02:09,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2019-01-11 11:02:09,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-11 11:02:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2019-01-11 11:02:09,574 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 146 [2019-01-11 11:02:09,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:09,574 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2019-01-11 11:02:09,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-11 11:02:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2019-01-11 11:02:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-01-11 11:02:09,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:09,575 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1] [2019-01-11 11:02:09,575 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:09,575 INFO L82 PathProgramCache]: Analyzing trace with hash -152191791, now seen corresponding path program 29 times [2019-01-11 11:02:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:09,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:09,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:09,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:11,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:11,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:11,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:11,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:11,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:11,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:11,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:11,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:11,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-11 11:02:11,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:11,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:11,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:11,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:11,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:11,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:12,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:14,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:14,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 94 [2019-01-11 11:02:14,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:14,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-11 11:02:14,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-11 11:02:14,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3789, Invalid=5141, Unknown=0, NotChecked=0, Total=8930 [2019-01-11 11:02:14,116 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 64 states. [2019-01-11 11:02:15,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:15,300 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2019-01-11 11:02:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 11:02:15,300 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 151 [2019-01-11 11:02:15,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:15,301 INFO L225 Difference]: With dead ends: 161 [2019-01-11 11:02:15,301 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 11:02:15,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4646 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6204, Invalid=9296, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:02:15,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 11:02:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2019-01-11 11:02:15,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-11 11:02:15,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-01-11 11:02:15,326 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 151 [2019-01-11 11:02:15,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:15,327 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-01-11 11:02:15,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-11 11:02:15,327 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-01-11 11:02:15,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-11 11:02:15,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:15,327 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1] [2019-01-11 11:02:15,328 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:15,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:15,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1949548185, now seen corresponding path program 30 times [2019-01-11 11:02:15,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:15,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:15,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:15,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:15,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:15,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:15,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:15,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:15,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:15,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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:16,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:16,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:16,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:16,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:16,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:16,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:16,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:16,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:16,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:16,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:18,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:18,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 97 [2019-01-11 11:02:18,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:18,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-11 11:02:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-11 11:02:18,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4039, Invalid=5467, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 11:02:18,291 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 66 states. [2019-01-11 11:02:19,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:19,825 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2019-01-11 11:02:19,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 11:02:19,825 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 156 [2019-01-11 11:02:19,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:19,826 INFO L225 Difference]: With dead ends: 166 [2019-01-11 11:02:19,826 INFO L226 Difference]: Without dead ends: 165 [2019-01-11 11:02:19,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4956 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6612, Invalid=9900, Unknown=0, NotChecked=0, Total=16512 [2019-01-11 11:02:19,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-11 11:02:19,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2019-01-11 11:02:19,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-11 11:02:19,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2019-01-11 11:02:19,859 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 156 [2019-01-11 11:02:19,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:19,859 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2019-01-11 11:02:19,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-11 11:02:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2019-01-11 11:02:19,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-01-11 11:02:19,860 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:19,860 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1] [2019-01-11 11:02:19,861 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:19,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:19,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1856558447, now seen corresponding path program 31 times [2019-01-11 11:02:19,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:19,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:19,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:19,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:20,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:20,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:20,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:20,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:20,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:20,723 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:20,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:20,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:20,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:20,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:20,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:20,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:20,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:21,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:23,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:23,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 100 [2019-01-11 11:02:23,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:23,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-11 11:02:23,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-11 11:02:23,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4297, Invalid=5803, Unknown=0, NotChecked=0, Total=10100 [2019-01-11 11:02:23,150 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 68 states. [2019-01-11 11:02:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:24,798 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-01-11 11:02:24,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 11:02:24,799 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 161 [2019-01-11 11:02:24,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:24,800 INFO L225 Difference]: With dead ends: 171 [2019-01-11 11:02:24,800 INFO L226 Difference]: Without dead ends: 170 [2019-01-11 11:02:24,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5276 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7033, Invalid=10523, Unknown=0, NotChecked=0, Total=17556 [2019-01-11 11:02:24,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-11 11:02:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2019-01-11 11:02:24,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-11 11:02:24,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2019-01-11 11:02:24,827 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 161 [2019-01-11 11:02:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:24,827 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2019-01-11 11:02:24,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-11 11:02:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2019-01-11 11:02:24,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-11 11:02:24,828 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:24,828 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1] [2019-01-11 11:02:24,828 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:24,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:24,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1390504871, now seen corresponding path program 32 times [2019-01-11 11:02:24,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:24,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:24,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:24,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:24,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:25,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:25,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:25,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:25,625 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:25,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:25,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:25,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:25,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:25,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-11 11:02:25,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:25,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:25,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:25,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:25,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:25,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:26,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:28,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:28,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 103 [2019-01-11 11:02:28,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:28,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-11 11:02:28,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-11 11:02:28,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=6149, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 11:02:28,327 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 70 states. [2019-01-11 11:02:30,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:30,137 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2019-01-11 11:02:30,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 11:02:30,138 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 166 [2019-01-11 11:02:30,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:30,139 INFO L225 Difference]: With dead ends: 176 [2019-01-11 11:02:30,139 INFO L226 Difference]: Without dead ends: 175 [2019-01-11 11:02:30,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5606 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7467, Invalid=11165, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 11:02:30,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-11 11:02:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2019-01-11 11:02:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-01-11 11:02:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-01-11 11:02:30,174 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 166 [2019-01-11 11:02:30,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:30,174 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-01-11 11:02:30,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-11 11:02:30,174 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-01-11 11:02:30,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-11 11:02:30,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:30,176 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1] [2019-01-11 11:02:30,176 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:30,176 INFO L82 PathProgramCache]: Analyzing trace with hash 136472657, now seen corresponding path program 33 times [2019-01-11 11:02:30,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:30,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:30,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:31,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:31,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:31,160 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:31,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:31,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:31,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:31,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:31,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:31,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:31,286 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:31,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:31,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:31,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:31,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:31,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:32,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:33,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:33,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 106 [2019-01-11 11:02:33,889 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:33,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-11 11:02:33,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-11 11:02:33,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4837, Invalid=6505, Unknown=0, NotChecked=0, Total=11342 [2019-01-11 11:02:33,891 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2019-01-11 11:02:35,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:35,556 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2019-01-11 11:02:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 11:02:35,556 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2019-01-11 11:02:35,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:35,557 INFO L225 Difference]: With dead ends: 181 [2019-01-11 11:02:35,557 INFO L226 Difference]: Without dead ends: 180 [2019-01-11 11:02:35,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5946 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7914, Invalid=11826, Unknown=0, NotChecked=0, Total=19740 [2019-01-11 11:02:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-11 11:02:35,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2019-01-11 11:02:35,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-11 11:02:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2019-01-11 11:02:35,589 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 171 [2019-01-11 11:02:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:35,590 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2019-01-11 11:02:35,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-11 11:02:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2019-01-11 11:02:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-11 11:02:35,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:35,591 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1] [2019-01-11 11:02:35,591 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:35,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:35,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1036597785, now seen corresponding path program 34 times [2019-01-11 11:02:35,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:35,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:35,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:35,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:35,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:36,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:36,477 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:36,478 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:36,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:36,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:36,478 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:36,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:36,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:36,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:36,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:36,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:36,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:36,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:36,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:37,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:39,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:39,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2019-01-11 11:02:39,801 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:39,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-11 11:02:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-11 11:02:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5119, Invalid=6871, Unknown=0, NotChecked=0, Total=11990 [2019-01-11 11:02:39,802 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 74 states. [2019-01-11 11:02:41,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:41,542 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-01-11 11:02:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 11:02:41,542 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 176 [2019-01-11 11:02:41,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:41,543 INFO L225 Difference]: With dead ends: 186 [2019-01-11 11:02:41,544 INFO L226 Difference]: Without dead ends: 185 [2019-01-11 11:02:41,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6296 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8374, Invalid=12506, Unknown=0, NotChecked=0, Total=20880 [2019-01-11 11:02:41,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-11 11:02:41,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2019-01-11 11:02:41,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-01-11 11:02:41,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2019-01-11 11:02:41,583 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 176 [2019-01-11 11:02:41,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:41,583 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2019-01-11 11:02:41,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-11 11:02:41,583 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2019-01-11 11:02:41,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-01-11 11:02:41,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:41,584 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1] [2019-01-11 11:02:41,585 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:41,585 INFO L82 PathProgramCache]: Analyzing trace with hash -414484975, now seen corresponding path program 35 times [2019-01-11 11:02:41,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:41,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:41,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:41,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:42,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:42,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:42,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:42,777 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:42,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:42,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:42,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:42,785 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:02:42,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:02:42,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-11 11:02:42,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:42,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:43,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:43,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:43,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:44,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:44,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:46,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:46,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:46,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 112 [2019-01-11 11:02:46,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:46,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-11 11:02:46,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-11 11:02:46,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5409, Invalid=7247, Unknown=0, NotChecked=0, Total=12656 [2019-01-11 11:02:46,227 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 76 states. [2019-01-11 11:02:47,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:47,804 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2019-01-11 11:02:47,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 11:02:47,805 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 181 [2019-01-11 11:02:47,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:47,806 INFO L225 Difference]: With dead ends: 191 [2019-01-11 11:02:47,806 INFO L226 Difference]: Without dead ends: 190 [2019-01-11 11:02:47,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6656 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=8847, Invalid=13205, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 11:02:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-01-11 11:02:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2019-01-11 11:02:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 11:02:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-01-11 11:02:47,844 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 181 [2019-01-11 11:02:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:47,844 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-01-11 11:02:47,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-11 11:02:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-01-11 11:02:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-11 11:02:47,845 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:47,845 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1] [2019-01-11 11:02:47,845 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:47,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:47,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1800425511, now seen corresponding path program 36 times [2019-01-11 11:02:47,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:47,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:47,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:47,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:47,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:49,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:49,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:49,873 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:49,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:49,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:49,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:49,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:02:49,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:02:50,002 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:02:50,002 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:02:50,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:50,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:50,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:50,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:50,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:51,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:02:53,811 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:53,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:02:53,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 115 [2019-01-11 11:02:53,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:02:53,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-11 11:02:53,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-11 11:02:53,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5707, Invalid=7633, Unknown=0, NotChecked=0, Total=13340 [2019-01-11 11:02:53,833 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 78 states. [2019-01-11 11:02:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:02:55,801 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-01-11 11:02:55,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 11:02:55,802 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 186 [2019-01-11 11:02:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:02:55,803 INFO L225 Difference]: With dead ends: 196 [2019-01-11 11:02:55,803 INFO L226 Difference]: Without dead ends: 195 [2019-01-11 11:02:55,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 295 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7026 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9333, Invalid=13923, Unknown=0, NotChecked=0, Total=23256 [2019-01-11 11:02:55,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-11 11:02:55,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 192. [2019-01-11 11:02:55,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-01-11 11:02:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2019-01-11 11:02:55,833 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 186 [2019-01-11 11:02:55,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:02:55,833 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2019-01-11 11:02:55,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-11 11:02:55,833 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2019-01-11 11:02:55,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-01-11 11:02:55,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:02:55,834 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1] [2019-01-11 11:02:55,834 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:02:55,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:02:55,834 INFO L82 PathProgramCache]: Analyzing trace with hash -271690799, now seen corresponding path program 37 times [2019-01-11 11:02:55,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:02:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:55,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:02:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:02:55,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:02:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:56,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:56,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:02:56,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:02:56,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:02:56,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:02:56,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:02:56,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:02:56,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:02:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:02:57,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:02:57,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:02:57,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:02:57,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:02:57,072 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:02:58,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:02:58,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:00,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:00,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 118 [2019-01-11 11:03:00,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:00,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-11 11:03:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-11 11:03:00,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6013, Invalid=8029, Unknown=0, NotChecked=0, Total=14042 [2019-01-11 11:03:00,251 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 80 states. [2019-01-11 11:03:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:02,000 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-01-11 11:03:02,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 11:03:02,000 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 191 [2019-01-11 11:03:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:02,001 INFO L225 Difference]: With dead ends: 201 [2019-01-11 11:03:02,001 INFO L226 Difference]: Without dead ends: 200 [2019-01-11 11:03:02,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7406 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=9832, Invalid=14660, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 11:03:02,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-01-11 11:03:02,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2019-01-11 11:03:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-11 11:03:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2019-01-11 11:03:02,041 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 191 [2019-01-11 11:03:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:02,042 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2019-01-11 11:03:02,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-11 11:03:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2019-01-11 11:03:02,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-11 11:03:02,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:02,043 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1] [2019-01-11 11:03:02,043 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:02,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:02,043 INFO L82 PathProgramCache]: Analyzing trace with hash -894301593, now seen corresponding path program 38 times [2019-01-11 11:03:02,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:02,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:02,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:02,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:02,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:03,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:03,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:03,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:03,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:03,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:03,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:03,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:03,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:03,778 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-11 11:03:03,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:03,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:03,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:03,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:03,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:03,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:04,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:04,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:07,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:07,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 121 [2019-01-11 11:03:07,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:07,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-11 11:03:07,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-11 11:03:07,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6327, Invalid=8435, Unknown=0, NotChecked=0, Total=14762 [2019-01-11 11:03:07,031 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 82 states. [2019-01-11 11:03:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:08,798 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2019-01-11 11:03:08,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 11:03:08,799 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 196 [2019-01-11 11:03:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:08,800 INFO L225 Difference]: With dead ends: 206 [2019-01-11 11:03:08,800 INFO L226 Difference]: Without dead ends: 205 [2019-01-11 11:03:08,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7796 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=10344, Invalid=15416, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:03:08,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-11 11:03:08,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2019-01-11 11:03:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 11:03:08,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-01-11 11:03:08,848 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 196 [2019-01-11 11:03:08,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:08,848 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-01-11 11:03:08,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-11 11:03:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-01-11 11:03:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-01-11 11:03:08,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:08,868 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1] [2019-01-11 11:03:08,868 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:08,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:08,868 INFO L82 PathProgramCache]: Analyzing trace with hash -676920943, now seen corresponding path program 39 times [2019-01-11 11:03:08,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:08,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:08,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:08,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:09,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:09,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:09,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:09,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:09,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:09,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:09,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:09,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:09,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:10,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:10,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:10,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:10,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:10,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:10,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:10,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:11,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:11,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 124 [2019-01-11 11:03:14,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:14,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-11 11:03:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-11 11:03:14,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6649, Invalid=8851, Unknown=0, NotChecked=0, Total=15500 [2019-01-11 11:03:14,110 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 84 states. [2019-01-11 11:03:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:16,285 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2019-01-11 11:03:16,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 11:03:16,285 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 201 [2019-01-11 11:03:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:16,286 INFO L225 Difference]: With dead ends: 211 [2019-01-11 11:03:16,286 INFO L226 Difference]: Without dead ends: 210 [2019-01-11 11:03:16,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8196 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10869, Invalid=16191, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:03:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-01-11 11:03:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2019-01-11 11:03:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-11 11:03:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2019-01-11 11:03:16,331 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 201 [2019-01-11 11:03:16,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:16,331 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2019-01-11 11:03:16,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-11 11:03:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2019-01-11 11:03:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-11 11:03:16,332 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:16,332 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1] [2019-01-11 11:03:16,333 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2015365977, now seen corresponding path program 40 times [2019-01-11 11:03:16,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:16,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:16,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:16,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:16,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:17,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:17,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:17,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:17,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:17,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:17,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:17,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:17,428 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:17,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:17,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:17,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:17,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:19,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:21,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:21,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:21,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 127 [2019-01-11 11:03:21,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:21,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-11 11:03:21,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-11 11:03:21,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6979, Invalid=9277, Unknown=0, NotChecked=0, Total=16256 [2019-01-11 11:03:21,584 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 86 states. [2019-01-11 11:03:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:23,599 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-01-11 11:03:23,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 11:03:23,599 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 206 [2019-01-11 11:03:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:23,600 INFO L225 Difference]: With dead ends: 216 [2019-01-11 11:03:23,600 INFO L226 Difference]: Without dead ends: 215 [2019-01-11 11:03:23,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8606 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11407, Invalid=16985, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 11:03:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-11 11:03:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2019-01-11 11:03:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 11:03:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2019-01-11 11:03:23,638 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 206 [2019-01-11 11:03:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:23,638 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2019-01-11 11:03:23,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-11 11:03:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2019-01-11 11:03:23,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-01-11 11:03:23,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:23,639 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1] [2019-01-11 11:03:23,639 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:23,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:23,640 INFO L82 PathProgramCache]: Analyzing trace with hash 164724561, now seen corresponding path program 41 times [2019-01-11 11:03:23,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:23,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:24,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:24,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:24,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:24,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:24,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:24,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:24,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:24,775 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:25,059 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-11 11:03:25,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:25,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:25,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:25,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:25,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:25,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:26,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:29,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:29,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 130 [2019-01-11 11:03:29,044 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:29,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-11 11:03:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-11 11:03:29,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7317, Invalid=9713, Unknown=0, NotChecked=0, Total=17030 [2019-01-11 11:03:29,046 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 88 states. [2019-01-11 11:03:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:31,238 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2019-01-11 11:03:31,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 11:03:31,239 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 211 [2019-01-11 11:03:31,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:31,240 INFO L225 Difference]: With dead ends: 221 [2019-01-11 11:03:31,240 INFO L226 Difference]: Without dead ends: 220 [2019-01-11 11:03:31,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9026 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=11958, Invalid=17798, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 11:03:31,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-01-11 11:03:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2019-01-11 11:03:31,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-11 11:03:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-01-11 11:03:31,285 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 211 [2019-01-11 11:03:31,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:31,285 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-01-11 11:03:31,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-11 11:03:31,285 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-01-11 11:03:31,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-01-11 11:03:31,286 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:31,286 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1] [2019-01-11 11:03:31,286 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:31,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:31,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1252127001, now seen corresponding path program 42 times [2019-01-11 11:03:31,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:31,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:31,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:31,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:32,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:32,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:32,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:32,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:32,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:32,437 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:32,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:32,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:32,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:32,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:32,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:32,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:32,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:32,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:33,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:36,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:36,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:36,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 133 [2019-01-11 11:03:36,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:36,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-11 11:03:36,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-11 11:03:36,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7663, Invalid=10159, Unknown=0, NotChecked=0, Total=17822 [2019-01-11 11:03:36,905 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 90 states. [2019-01-11 11:03:39,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:39,029 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2019-01-11 11:03:39,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 11:03:39,029 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 216 [2019-01-11 11:03:39,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:39,030 INFO L225 Difference]: With dead ends: 226 [2019-01-11 11:03:39,030 INFO L226 Difference]: Without dead ends: 225 [2019-01-11 11:03:39,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 343 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9456 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12522, Invalid=18630, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 11:03:39,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2019-01-11 11:03:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2019-01-11 11:03:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-11 11:03:39,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2019-01-11 11:03:39,069 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 216 [2019-01-11 11:03:39,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:39,069 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2019-01-11 11:03:39,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-11 11:03:39,070 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2019-01-11 11:03:39,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2019-01-11 11:03:39,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:39,071 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1] [2019-01-11 11:03:39,071 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:39,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1716112657, now seen corresponding path program 43 times [2019-01-11 11:03:39,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:39,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:39,072 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:39,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:39,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:40,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:40,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:40,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:40,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:40,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:40,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:40,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:03:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:40,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:40,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:40,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:40,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:40,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:42,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:44,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 136 [2019-01-11 11:03:44,956 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:44,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-11 11:03:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-11 11:03:44,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8017, Invalid=10615, Unknown=0, NotChecked=0, Total=18632 [2019-01-11 11:03:44,958 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 92 states. [2019-01-11 11:03:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:47,500 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-01-11 11:03:47,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 11:03:47,500 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 221 [2019-01-11 11:03:47,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:47,501 INFO L225 Difference]: With dead ends: 231 [2019-01-11 11:03:47,501 INFO L226 Difference]: Without dead ends: 230 [2019-01-11 11:03:47,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9896 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=13099, Invalid=19481, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:03:47,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-11 11:03:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-11 11:03:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-11 11:03:47,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2019-01-11 11:03:47,557 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 221 [2019-01-11 11:03:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:47,557 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2019-01-11 11:03:47,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-11 11:03:47,558 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2019-01-11 11:03:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-01-11 11:03:47,559 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:47,559 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1] [2019-01-11 11:03:47,559 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:47,560 INFO L82 PathProgramCache]: Analyzing trace with hash 279992615, now seen corresponding path program 44 times [2019-01-11 11:03:47,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:47,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:03:47,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:47,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:48,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:48,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:48,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:48,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:48,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:48,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:48,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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:48,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:03:48,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:03:49,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-11 11:03:49,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:49,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:49,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:49,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:49,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:49,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:50,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:03:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:53,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:03:53,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 139 [2019-01-11 11:03:53,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:03:53,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-11 11:03:53,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-11 11:03:53,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8379, Invalid=11081, Unknown=0, NotChecked=0, Total=19460 [2019-01-11 11:03:53,453 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 94 states. [2019-01-11 11:03:55,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:03:55,773 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2019-01-11 11:03:55,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 11:03:55,774 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 226 [2019-01-11 11:03:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:03:55,775 INFO L225 Difference]: With dead ends: 236 [2019-01-11 11:03:55,775 INFO L226 Difference]: Without dead ends: 235 [2019-01-11 11:03:55,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 542 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10346 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=13689, Invalid=20351, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 11:03:55,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-11 11:03:55,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2019-01-11 11:03:55,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-01-11 11:03:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-01-11 11:03:55,827 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 226 [2019-01-11 11:03:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:03:55,828 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-01-11 11:03:55,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-11 11:03:55,828 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-01-11 11:03:55,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-01-11 11:03:55,829 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:03:55,829 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1] [2019-01-11 11:03:55,829 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:03:55,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:03:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 34335441, now seen corresponding path program 45 times [2019-01-11 11:03:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:03:55,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:55,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:03:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:03:55,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:03:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:03:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:57,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:57,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:03:57,452 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:03:57,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:03:57,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:03:57,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:03:57,462 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:03:57,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:03:57,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:03:57,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:03:57,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:03:57,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:03:57,622 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:03:57,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:03:57,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:03:59,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:03:59,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:02,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:02,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 142 [2019-01-11 11:04:02,128 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:02,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-11 11:04:02,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-11 11:04:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8749, Invalid=11557, Unknown=0, NotChecked=0, Total=20306 [2019-01-11 11:04:02,130 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 96 states. [2019-01-11 11:04:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:04,620 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2019-01-11 11:04:04,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 11:04:04,621 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 231 [2019-01-11 11:04:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:04,622 INFO L225 Difference]: With dead ends: 241 [2019-01-11 11:04:04,622 INFO L226 Difference]: Without dead ends: 240 [2019-01-11 11:04:04,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10806 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=14292, Invalid=21240, Unknown=0, NotChecked=0, Total=35532 [2019-01-11 11:04:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-11 11:04:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2019-01-11 11:04:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-01-11 11:04:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2019-01-11 11:04:04,686 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 231 [2019-01-11 11:04:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:04,686 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2019-01-11 11:04:04,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-11 11:04:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2019-01-11 11:04:04,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-01-11 11:04:04,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:04,688 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1] [2019-01-11 11:04:04,688 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:04,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:04,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1113248615, now seen corresponding path program 46 times [2019-01-11 11:04:04,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:04,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:04,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:06,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:06,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:06,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:06,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:06,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:06,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:06,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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:06,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:06,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:06,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:06,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:06,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:06,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:06,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:08,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:11,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:11,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 145 [2019-01-11 11:04:11,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:11,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-11 11:04:11,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-11 11:04:11,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9127, Invalid=12043, Unknown=0, NotChecked=0, Total=21170 [2019-01-11 11:04:11,306 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 98 states. [2019-01-11 11:04:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:13,940 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-01-11 11:04:13,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 11:04:13,940 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 236 [2019-01-11 11:04:13,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:13,942 INFO L225 Difference]: With dead ends: 246 [2019-01-11 11:04:13,942 INFO L226 Difference]: Without dead ends: 245 [2019-01-11 11:04:13,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 566 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11276 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=14908, Invalid=22148, Unknown=0, NotChecked=0, Total=37056 [2019-01-11 11:04:13,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-11 11:04:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2019-01-11 11:04:13,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-11 11:04:13,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2019-01-11 11:04:13,989 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 236 [2019-01-11 11:04:13,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:13,989 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2019-01-11 11:04:13,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-11 11:04:13,989 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2019-01-11 11:04:13,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-11 11:04:13,990 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:13,990 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1] [2019-01-11 11:04:13,990 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash -418129775, now seen corresponding path program 47 times [2019-01-11 11:04:13,991 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:13,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:13,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:13,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:15,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:15,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:15,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:15,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:15,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:15,500 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:15,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:15,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-11 11:04:15,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:15,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:15,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:15,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:15,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:15,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:17,629 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:17,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:20,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:20,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:20,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 148 [2019-01-11 11:04:20,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:20,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-11 11:04:20,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-11 11:04:20,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9513, Invalid=12539, Unknown=0, NotChecked=0, Total=22052 [2019-01-11 11:04:20,765 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 100 states. [2019-01-11 11:04:23,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:23,383 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2019-01-11 11:04:23,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 11:04:23,384 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 241 [2019-01-11 11:04:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:23,385 INFO L225 Difference]: With dead ends: 251 [2019-01-11 11:04:23,385 INFO L226 Difference]: Without dead ends: 250 [2019-01-11 11:04:23,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 578 GetRequests, 383 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11756 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=15537, Invalid=23075, Unknown=0, NotChecked=0, Total=38612 [2019-01-11 11:04:23,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-11 11:04:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2019-01-11 11:04:23,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-11 11:04:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-01-11 11:04:23,429 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 241 [2019-01-11 11:04:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:23,429 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-01-11 11:04:23,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-11 11:04:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-01-11 11:04:23,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-01-11 11:04:23,430 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:23,431 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1] [2019-01-11 11:04:23,431 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:23,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:23,431 INFO L82 PathProgramCache]: Analyzing trace with hash 501317031, now seen corresponding path program 48 times [2019-01-11 11:04:23,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:23,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:23,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:23,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:24,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:24,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:24,790 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:24,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:24,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:24,790 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:24,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:24,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:24,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:24,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:24,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:24,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:24,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:24,982 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:24,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:26,584 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:26,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:31,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:31,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:31,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-01-11 11:04:31,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:31,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-11 11:04:31,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-11 11:04:31,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9907, Invalid=13045, Unknown=0, NotChecked=0, Total=22952 [2019-01-11 11:04:31,728 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 102 states. [2019-01-11 11:04:34,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:34,471 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2019-01-11 11:04:34,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 11:04:34,472 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 246 [2019-01-11 11:04:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:34,473 INFO L225 Difference]: With dead ends: 256 [2019-01-11 11:04:34,473 INFO L226 Difference]: Without dead ends: 255 [2019-01-11 11:04:34,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12246 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=16179, Invalid=24021, Unknown=0, NotChecked=0, Total=40200 [2019-01-11 11:04:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-01-11 11:04:34,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2019-01-11 11:04:34,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-11 11:04:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2019-01-11 11:04:34,527 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 246 [2019-01-11 11:04:34,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:34,527 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2019-01-11 11:04:34,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-11 11:04:34,527 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2019-01-11 11:04:34,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-01-11 11:04:34,529 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:34,529 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1] [2019-01-11 11:04:34,529 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:34,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:34,529 INFO L82 PathProgramCache]: Analyzing trace with hash -732064175, now seen corresponding path program 49 times [2019-01-11 11:04:34,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:34,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:34,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:34,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:34,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:35,882 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:35,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:35,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:35,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:35,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:35,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:35,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:35,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:35,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:04:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:36,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:36,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:36,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:36,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:36,071 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:38,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:41,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:41,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-11 11:04:41,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:41,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-11 11:04:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-11 11:04:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10309, Invalid=13561, Unknown=0, NotChecked=0, Total=23870 [2019-01-11 11:04:41,429 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 104 states. [2019-01-11 11:04:44,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:44,328 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-01-11 11:04:44,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 11:04:44,333 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 251 [2019-01-11 11:04:44,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:44,334 INFO L225 Difference]: With dead ends: 261 [2019-01-11 11:04:44,334 INFO L226 Difference]: Without dead ends: 260 [2019-01-11 11:04:44,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12746 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=16834, Invalid=24986, Unknown=0, NotChecked=0, Total=41820 [2019-01-11 11:04:44,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-01-11 11:04:44,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 257. [2019-01-11 11:04:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-11 11:04:44,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2019-01-11 11:04:44,389 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 251 [2019-01-11 11:04:44,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:44,389 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2019-01-11 11:04:44,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-11 11:04:44,389 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2019-01-11 11:04:44,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-01-11 11:04:44,391 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:44,391 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1] [2019-01-11 11:04:44,391 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -506963993, now seen corresponding path program 50 times [2019-01-11 11:04:44,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:44,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:04:44,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:44,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:45,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:45,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:45,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:45,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:45,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:45,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:45,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:45,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:04:45,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:04:46,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-11 11:04:46,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:46,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:46,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:46,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:46,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:46,219 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:48,136 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:48,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:04:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:51,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:04:51,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-11 11:04:51,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:04:51,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-11 11:04:51,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-11 11:04:51,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10412, Invalid=13768, Unknown=0, NotChecked=0, Total=24180 [2019-01-11 11:04:51,568 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 106 states. [2019-01-11 11:04:54,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:04:54,516 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2019-01-11 11:04:54,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 11:04:54,516 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 256 [2019-01-11 11:04:54,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:04:54,517 INFO L225 Difference]: With dead ends: 266 [2019-01-11 11:04:54,517 INFO L226 Difference]: Without dead ends: 265 [2019-01-11 11:04:54,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 407 SyntacticMatches, 2 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13347 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=17093, Invalid=25549, Unknown=0, NotChecked=0, Total=42642 [2019-01-11 11:04:54,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-11 11:04:54,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 262. [2019-01-11 11:04:54,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-01-11 11:04:54,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-01-11 11:04:54,565 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 256 [2019-01-11 11:04:54,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:04:54,566 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-01-11 11:04:54,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-11 11:04:54,566 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-01-11 11:04:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-01-11 11:04:54,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:04:54,567 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1] [2019-01-11 11:04:54,568 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:04:54,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:04:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash -35314671, now seen corresponding path program 51 times [2019-01-11 11:04:54,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:04:54,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:54,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:04:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:04:54,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:04:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:04:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:56,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:56,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:04:56,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:04:56,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:04:56,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:04:56,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:04:56,112 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:04:56,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:04:56,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:04:56,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:04:56,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:04:56,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:04:56,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:04:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:04:56,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:04:58,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:04:58,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:01,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:01,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-11 11:05:01,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:01,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-11 11:05:01,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-11 11:05:01,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10515, Invalid=13977, Unknown=0, NotChecked=0, Total=24492 [2019-01-11 11:05:01,895 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 108 states. [2019-01-11 11:05:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:04,936 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2019-01-11 11:05:04,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-11 11:05:04,937 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 261 [2019-01-11 11:05:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:04,938 INFO L225 Difference]: With dead ends: 271 [2019-01-11 11:05:04,938 INFO L226 Difference]: Without dead ends: 270 [2019-01-11 11:05:04,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 415 SyntacticMatches, 4 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13950 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=17353, Invalid=26119, Unknown=0, NotChecked=0, Total=43472 [2019-01-11 11:05:04,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-01-11 11:05:04,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 267. [2019-01-11 11:05:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-01-11 11:05:04,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2019-01-11 11:05:04,992 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 261 [2019-01-11 11:05:04,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:04,992 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2019-01-11 11:05:04,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-11 11:05:04,992 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2019-01-11 11:05:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-01-11 11:05:04,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:04,993 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1] [2019-01-11 11:05:04,993 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:04,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:04,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2006147623, now seen corresponding path program 52 times [2019-01-11 11:05:04,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:04,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:04,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:04,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:04,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:06,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:06,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:06,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:06,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:06,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:06,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:06,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:06,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:06,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:06,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:06,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:06,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:06,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:06,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:08,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:08,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:12,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:12,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-11 11:05:12,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:12,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-11 11:05:12,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-11 11:05:12,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10618, Invalid=14188, Unknown=0, NotChecked=0, Total=24806 [2019-01-11 11:05:12,582 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 110 states. [2019-01-11 11:05:15,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:15,654 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-01-11 11:05:15,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-11 11:05:15,654 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 266 [2019-01-11 11:05:15,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:15,655 INFO L225 Difference]: With dead ends: 276 [2019-01-11 11:05:15,655 INFO L226 Difference]: Without dead ends: 275 [2019-01-11 11:05:15,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 423 SyntacticMatches, 6 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14555 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=17614, Invalid=26696, Unknown=0, NotChecked=0, Total=44310 [2019-01-11 11:05:15,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-11 11:05:15,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2019-01-11 11:05:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-01-11 11:05:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2019-01-11 11:05:15,715 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 266 [2019-01-11 11:05:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:15,715 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2019-01-11 11:05:15,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-11 11:05:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2019-01-11 11:05:15,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-11 11:05:15,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:15,716 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1] [2019-01-11 11:05:15,717 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:15,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:15,717 INFO L82 PathProgramCache]: Analyzing trace with hash -861503023, now seen corresponding path program 53 times [2019-01-11 11:05:15,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:15,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:15,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:15,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:15,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:17,366 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:17,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:17,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:17,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:17,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:17,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:17,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:17,376 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:17,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:17,768 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-11 11:05:17,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:17,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:17,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:17,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:17,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:17,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:19,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:23,731 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:23,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:23,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-11 11:05:23,750 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:23,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-11 11:05:23,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-11 11:05:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10721, Invalid=14401, Unknown=0, NotChecked=0, Total=25122 [2019-01-11 11:05:23,753 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 112 states. [2019-01-11 11:05:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:26,773 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2019-01-11 11:05:26,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-11 11:05:26,773 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 271 [2019-01-11 11:05:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:26,774 INFO L225 Difference]: With dead ends: 281 [2019-01-11 11:05:26,774 INFO L226 Difference]: Without dead ends: 280 [2019-01-11 11:05:26,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 650 GetRequests, 431 SyntacticMatches, 8 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15162 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=17876, Invalid=27280, Unknown=0, NotChecked=0, Total=45156 [2019-01-11 11:05:26,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-01-11 11:05:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2019-01-11 11:05:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-01-11 11:05:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-01-11 11:05:26,842 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 271 [2019-01-11 11:05:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:26,842 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-01-11 11:05:26,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-11 11:05:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-01-11 11:05:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-01-11 11:05:26,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:26,844 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1] [2019-01-11 11:05:26,844 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:26,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1278829465, now seen corresponding path program 54 times [2019-01-11 11:05:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:26,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:26,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:28,481 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:28,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:28,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:28,481 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:28,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:28,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:28,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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:28,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:05:28,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:05:28,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:05:28,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:28,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:28,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:28,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:28,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:28,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:30,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:34,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:34,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-11 11:05:34,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:34,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-11 11:05:34,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-11 11:05:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10824, Invalid=14616, Unknown=0, NotChecked=0, Total=25440 [2019-01-11 11:05:34,622 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 114 states. [2019-01-11 11:05:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:37,779 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2019-01-11 11:05:37,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-11 11:05:37,779 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 276 [2019-01-11 11:05:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:37,780 INFO L225 Difference]: With dead ends: 286 [2019-01-11 11:05:37,780 INFO L226 Difference]: Without dead ends: 285 [2019-01-11 11:05:37,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 662 GetRequests, 439 SyntacticMatches, 10 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15771 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=18139, Invalid=27871, Unknown=0, NotChecked=0, Total=46010 [2019-01-11 11:05:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-01-11 11:05:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2019-01-11 11:05:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-11 11:05:37,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2019-01-11 11:05:37,850 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 276 [2019-01-11 11:05:37,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:37,851 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2019-01-11 11:05:37,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-11 11:05:37,851 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2019-01-11 11:05:37,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-11 11:05:37,852 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:37,852 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1] [2019-01-11 11:05:37,852 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:37,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1633833071, now seen corresponding path program 55 times [2019-01-11 11:05:37,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:37,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:05:37,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:37,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:39,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:39,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:39,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:39,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:39,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:39,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:39,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:39,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:05:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:40,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:40,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:40,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:40,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:40,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:42,310 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:42,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:46,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:46,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-11 11:05:46,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:46,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-11 11:05:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-11 11:05:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10927, Invalid=14833, Unknown=0, NotChecked=0, Total=25760 [2019-01-11 11:05:46,392 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 116 states. [2019-01-11 11:05:49,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:05:49,722 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-01-11 11:05:49,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-11 11:05:49,722 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 281 [2019-01-11 11:05:49,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:05:49,723 INFO L225 Difference]: With dead ends: 291 [2019-01-11 11:05:49,723 INFO L226 Difference]: Without dead ends: 290 [2019-01-11 11:05:49,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 447 SyntacticMatches, 12 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16382 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18403, Invalid=28469, Unknown=0, NotChecked=0, Total=46872 [2019-01-11 11:05:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-01-11 11:05:49,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 287. [2019-01-11 11:05:49,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-01-11 11:05:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2019-01-11 11:05:49,784 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 281 [2019-01-11 11:05:49,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:05:49,784 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2019-01-11 11:05:49,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-11 11:05:49,784 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2019-01-11 11:05:49,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-01-11 11:05:49,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:05:49,785 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1] [2019-01-11 11:05:49,785 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:05:49,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:05:49,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1780087129, now seen corresponding path program 56 times [2019-01-11 11:05:49,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:05:49,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:49,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:05:49,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:05:49,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:05:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:05:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:51,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:51,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:05:51,573 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:05:51,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:05:51,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:05:51,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:05:51,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:05:51,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:05:51,992 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-11 11:05:51,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:05:52,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:05:52,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:05:52,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:05:52,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:05:52,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:05:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:54,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:05:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:05:57,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:05:57,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-11 11:05:57,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:05:57,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-11 11:05:57,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-11 11:05:57,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11030, Invalid=15052, Unknown=0, NotChecked=0, Total=26082 [2019-01-11 11:05:57,942 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 118 states. [2019-01-11 11:06:01,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:01,568 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2019-01-11 11:06:01,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-11 11:06:01,569 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 286 [2019-01-11 11:06:01,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:01,570 INFO L225 Difference]: With dead ends: 296 [2019-01-11 11:06:01,570 INFO L226 Difference]: Without dead ends: 295 [2019-01-11 11:06:01,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 686 GetRequests, 455 SyntacticMatches, 14 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16995 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=18668, Invalid=29074, Unknown=0, NotChecked=0, Total=47742 [2019-01-11 11:06:01,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-01-11 11:06:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2019-01-11 11:06:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-01-11 11:06:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-01-11 11:06:01,630 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 286 [2019-01-11 11:06:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:01,630 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-01-11 11:06:01,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-11 11:06:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-01-11 11:06:01,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-01-11 11:06:01,631 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:01,631 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1] [2019-01-11 11:06:01,632 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:01,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:01,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2033799855, now seen corresponding path program 57 times [2019-01-11 11:06:01,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:01,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:01,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:01,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:03,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:03,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:03,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:03,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:03,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:03,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:03,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:03,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:03,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:03,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:03,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:03,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:03,697 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:03,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:03,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:06,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:10,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:10,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-11 11:06:10,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:10,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-11 11:06:10,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-11 11:06:10,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11133, Invalid=15273, Unknown=0, NotChecked=0, Total=26406 [2019-01-11 11:06:10,159 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 120 states. [2019-01-11 11:06:13,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:13,554 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2019-01-11 11:06:13,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-11 11:06:13,554 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 291 [2019-01-11 11:06:13,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:13,555 INFO L225 Difference]: With dead ends: 301 [2019-01-11 11:06:13,556 INFO L226 Difference]: Without dead ends: 300 [2019-01-11 11:06:13,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 463 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17610 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=18934, Invalid=29686, Unknown=0, NotChecked=0, Total=48620 [2019-01-11 11:06:13,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-01-11 11:06:13,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 297. [2019-01-11 11:06:13,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-01-11 11:06:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2019-01-11 11:06:13,627 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 291 [2019-01-11 11:06:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:13,627 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2019-01-11 11:06:13,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-11 11:06:13,627 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2019-01-11 11:06:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-11 11:06:13,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:13,629 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1] [2019-01-11 11:06:13,629 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2005557017, now seen corresponding path program 58 times [2019-01-11 11:06:13,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:13,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:13,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:13,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:13,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:15,837 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:15,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:15,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:15,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:15,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:15,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:15,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:15,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:15,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:16,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:16,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:16,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:16,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:16,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:18,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:18,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:22,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:22,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-11 11:06:22,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-11 11:06:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-11 11:06:22,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11236, Invalid=15496, Unknown=0, NotChecked=0, Total=26732 [2019-01-11 11:06:22,477 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 122 states. [2019-01-11 11:06:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:26,127 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-01-11 11:06:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-11 11:06:26,128 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 296 [2019-01-11 11:06:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:26,129 INFO L225 Difference]: With dead ends: 306 [2019-01-11 11:06:26,129 INFO L226 Difference]: Without dead ends: 305 [2019-01-11 11:06:26,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 710 GetRequests, 471 SyntacticMatches, 18 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18227 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19201, Invalid=30305, Unknown=0, NotChecked=0, Total=49506 [2019-01-11 11:06:26,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-01-11 11:06:26,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2019-01-11 11:06:26,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2019-01-11 11:06:26,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2019-01-11 11:06:26,204 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 296 [2019-01-11 11:06:26,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:26,204 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2019-01-11 11:06:26,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-11 11:06:26,204 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2019-01-11 11:06:26,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2019-01-11 11:06:26,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:26,206 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1] [2019-01-11 11:06:26,206 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:26,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:26,206 INFO L82 PathProgramCache]: Analyzing trace with hash 220035857, now seen corresponding path program 59 times [2019-01-11 11:06:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:26,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:26,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:26,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:28,164 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:28,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:28,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:28,164 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:28,165 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:28,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:28,165 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:28,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:06:28,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:06:28,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-11 11:06:28,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:28,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:28,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:28,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:28,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:28,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:31,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:31,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:35,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:35,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-11 11:06:35,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:35,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-11 11:06:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-11 11:06:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11339, Invalid=15721, Unknown=0, NotChecked=0, Total=27060 [2019-01-11 11:06:35,079 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 124 states. [2019-01-11 11:06:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:38,701 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2019-01-11 11:06:38,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-11 11:06:38,703 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 301 [2019-01-11 11:06:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:38,705 INFO L225 Difference]: With dead ends: 311 [2019-01-11 11:06:38,705 INFO L226 Difference]: Without dead ends: 310 [2019-01-11 11:06:38,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 722 GetRequests, 479 SyntacticMatches, 20 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19469, Invalid=30931, Unknown=0, NotChecked=0, Total=50400 [2019-01-11 11:06:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-01-11 11:06:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2019-01-11 11:06:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-01-11 11:06:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2019-01-11 11:06:38,773 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 301 [2019-01-11 11:06:38,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:38,774 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2019-01-11 11:06:38,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-11 11:06:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2019-01-11 11:06:38,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-01-11 11:06:38,775 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:38,775 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1] [2019-01-11 11:06:38,775 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:38,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1594266841, now seen corresponding path program 60 times [2019-01-11 11:06:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:38,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:38,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:38,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:41,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:41,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:41,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:41,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:41,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:41,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:41,114 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:06:41,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:06:41,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:06:41,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:06:41,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:41,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:41,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:41,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:41,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:43,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:06:47,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:47,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:06:47,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-11 11:06:47,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:06:47,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-11 11:06:47,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-11 11:06:47,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11442, Invalid=15948, Unknown=0, NotChecked=0, Total=27390 [2019-01-11 11:06:47,772 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 126 states. [2019-01-11 11:06:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:06:51,648 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2019-01-11 11:06:51,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-11 11:06:51,648 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 306 [2019-01-11 11:06:51,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:06:51,649 INFO L225 Difference]: With dead ends: 316 [2019-01-11 11:06:51,650 INFO L226 Difference]: Without dead ends: 315 [2019-01-11 11:06:51,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 734 GetRequests, 487 SyntacticMatches, 22 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19467 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19738, Invalid=31564, Unknown=0, NotChecked=0, Total=51302 [2019-01-11 11:06:51,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-11 11:06:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 312. [2019-01-11 11:06:51,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-01-11 11:06:51,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2019-01-11 11:06:51,723 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 306 [2019-01-11 11:06:51,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:06:51,724 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2019-01-11 11:06:51,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-11 11:06:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2019-01-11 11:06:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-01-11 11:06:51,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:06:51,725 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1] [2019-01-11 11:06:51,725 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:06:51,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:06:51,725 INFO L82 PathProgramCache]: Analyzing trace with hash -291628847, now seen corresponding path program 61 times [2019-01-11 11:06:51,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:06:51,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:51,726 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:06:51,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:06:51,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:06:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:53,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:53,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:06:53,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:06:53,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:06:53,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:06:53,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:06:53,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:06:53,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:06:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:06:53,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:06:53,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:06:53,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:06:53,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:06:53,990 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:06:56,637 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:06:56,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:00,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:00,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-11 11:07:00,488 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:00,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-11 11:07:00,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-11 11:07:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11545, Invalid=16177, Unknown=0, NotChecked=0, Total=27722 [2019-01-11 11:07:00,492 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 128 states. [2019-01-11 11:07:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:04,327 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2019-01-11 11:07:04,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-11 11:07:04,327 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 311 [2019-01-11 11:07:04,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:04,328 INFO L225 Difference]: With dead ends: 321 [2019-01-11 11:07:04,329 INFO L226 Difference]: Without dead ends: 320 [2019-01-11 11:07:04,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 746 GetRequests, 495 SyntacticMatches, 24 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20090 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=20008, Invalid=32204, Unknown=0, NotChecked=0, Total=52212 [2019-01-11 11:07:04,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-01-11 11:07:04,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 317. [2019-01-11 11:07:04,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-01-11 11:07:04,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2019-01-11 11:07:04,402 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 311 [2019-01-11 11:07:04,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:04,402 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2019-01-11 11:07:04,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-11 11:07:04,402 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2019-01-11 11:07:04,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-01-11 11:07:04,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:04,404 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1] [2019-01-11 11:07:04,404 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:04,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:04,404 INFO L82 PathProgramCache]: Analyzing trace with hash -537565849, now seen corresponding path program 62 times [2019-01-11 11:07:04,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:04,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:04,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:04,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:06,748 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:06,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:06,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:06,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:06,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:06,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:06,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:06,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:06,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:07,232 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-11 11:07:07,233 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:07,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:07,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:07,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:07,254 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:07,254 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:09,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:14,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:14,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-11 11:07:14,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:14,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-11 11:07:14,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-11 11:07:14,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11648, Invalid=16408, Unknown=0, NotChecked=0, Total=28056 [2019-01-11 11:07:14,031 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 130 states. [2019-01-11 11:07:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:18,258 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2019-01-11 11:07:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-11 11:07:18,259 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 316 [2019-01-11 11:07:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:18,260 INFO L225 Difference]: With dead ends: 326 [2019-01-11 11:07:18,260 INFO L226 Difference]: Without dead ends: 325 [2019-01-11 11:07:18,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 503 SyntacticMatches, 26 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20715 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=20279, Invalid=32851, Unknown=0, NotChecked=0, Total=53130 [2019-01-11 11:07:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-01-11 11:07:18,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 322. [2019-01-11 11:07:18,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-01-11 11:07:18,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2019-01-11 11:07:18,335 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 316 [2019-01-11 11:07:18,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:18,336 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2019-01-11 11:07:18,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-11 11:07:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2019-01-11 11:07:18,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-01-11 11:07:18,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:18,337 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1] [2019-01-11 11:07:18,337 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:18,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:18,338 INFO L82 PathProgramCache]: Analyzing trace with hash -582711663, now seen corresponding path program 63 times [2019-01-11 11:07:18,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:18,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:18,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:18,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:18,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:20,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:20,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:20,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:20,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:20,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:20,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:20,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:20,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:07:20,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:07:20,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:07:20,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:20,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:20,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:20,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:20,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:20,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:23,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:27,796 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-11 11:07:27,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:27,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-11 11:07:27,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-11 11:07:27,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11751, Invalid=16641, Unknown=0, NotChecked=0, Total=28392 [2019-01-11 11:07:27,818 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 132 states. [2019-01-11 11:07:31,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:31,966 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2019-01-11 11:07:31,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-11 11:07:31,966 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 321 [2019-01-11 11:07:31,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:31,968 INFO L225 Difference]: With dead ends: 331 [2019-01-11 11:07:31,968 INFO L226 Difference]: Without dead ends: 330 [2019-01-11 11:07:31,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 511 SyntacticMatches, 28 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21342 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20551, Invalid=33505, Unknown=0, NotChecked=0, Total=54056 [2019-01-11 11:07:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-01-11 11:07:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2019-01-11 11:07:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-01-11 11:07:32,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2019-01-11 11:07:32,046 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 321 [2019-01-11 11:07:32,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:32,046 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2019-01-11 11:07:32,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-11 11:07:32,047 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2019-01-11 11:07:32,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-01-11 11:07:32,047 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:32,048 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1] [2019-01-11 11:07:32,048 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:32,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:32,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1894616999, now seen corresponding path program 64 times [2019-01-11 11:07:32,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:32,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:07:32,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:32,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:32,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:34,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:34,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:34,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:34,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:34,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:34,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:34,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:34,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:07:34,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:34,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:34,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:34,627 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:34,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:34,645 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:37,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:37,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:41,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:41,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-11 11:07:41,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:41,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-11 11:07:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-11 11:07:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11854, Invalid=16876, Unknown=0, NotChecked=0, Total=28730 [2019-01-11 11:07:41,631 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 134 states. [2019-01-11 11:07:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:07:45,817 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2019-01-11 11:07:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-11 11:07:45,817 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 326 [2019-01-11 11:07:45,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:07:45,818 INFO L225 Difference]: With dead ends: 336 [2019-01-11 11:07:45,818 INFO L226 Difference]: Without dead ends: 335 [2019-01-11 11:07:45,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 519 SyntacticMatches, 30 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21971 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20824, Invalid=34166, Unknown=0, NotChecked=0, Total=54990 [2019-01-11 11:07:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-01-11 11:07:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2019-01-11 11:07:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2019-01-11 11:07:45,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2019-01-11 11:07:45,896 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 326 [2019-01-11 11:07:45,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:07:45,896 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2019-01-11 11:07:45,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-11 11:07:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2019-01-11 11:07:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-01-11 11:07:45,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:07:45,898 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1] [2019-01-11 11:07:45,898 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:07:45,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:07:45,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1074578513, now seen corresponding path program 65 times [2019-01-11 11:07:45,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:07:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:45,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:07:45,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:07:45,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:07:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:07:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:48,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:48,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:07:48,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:07:48,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:07:48,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:07:48,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:07:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:07:48,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:07:49,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-11 11:07:49,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:07:49,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:07:49,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:07:49,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:07:49,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:07:49,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:07:51,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:51,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:07:55,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:07:55,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:07:55,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-11 11:07:55,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:07:55,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-11 11:07:55,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-11 11:07:55,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11957, Invalid=17113, Unknown=0, NotChecked=0, Total=29070 [2019-01-11 11:07:55,953 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 136 states. [2019-01-11 11:08:00,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:00,488 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2019-01-11 11:08:00,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-11 11:08:00,489 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 331 [2019-01-11 11:08:00,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:00,490 INFO L225 Difference]: With dead ends: 341 [2019-01-11 11:08:00,490 INFO L226 Difference]: Without dead ends: 340 [2019-01-11 11:08:00,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 794 GetRequests, 527 SyntacticMatches, 32 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22602 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=21098, Invalid=34834, Unknown=0, NotChecked=0, Total=55932 [2019-01-11 11:08:00,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-01-11 11:08:00,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2019-01-11 11:08:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-01-11 11:08:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2019-01-11 11:08:00,571 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 331 [2019-01-11 11:08:00,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:00,571 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2019-01-11 11:08:00,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-11 11:08:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2019-01-11 11:08:00,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-11 11:08:00,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:00,573 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1] [2019-01-11 11:08:00,573 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:00,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:00,573 INFO L82 PathProgramCache]: Analyzing trace with hash -362419737, now seen corresponding path program 66 times [2019-01-11 11:08:00,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:00,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:00,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:00,574 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:03,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:03,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:03,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:03,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:03,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:03,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:03,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:03,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:03,500 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:03,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:03,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:03,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:03,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:03,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:03,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:06,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:10,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:10,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-11 11:08:10,754 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:10,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-11 11:08:10,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-11 11:08:10,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12060, Invalid=17352, Unknown=0, NotChecked=0, Total=29412 [2019-01-11 11:08:10,757 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 138 states. [2019-01-11 11:08:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:15,347 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2019-01-11 11:08:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-11 11:08:15,348 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 336 [2019-01-11 11:08:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:15,349 INFO L225 Difference]: With dead ends: 346 [2019-01-11 11:08:15,349 INFO L226 Difference]: Without dead ends: 345 [2019-01-11 11:08:15,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 806 GetRequests, 535 SyntacticMatches, 34 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23235 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=21373, Invalid=35509, Unknown=0, NotChecked=0, Total=56882 [2019-01-11 11:08:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-11 11:08:15,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 342. [2019-01-11 11:08:15,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-11 11:08:15,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2019-01-11 11:08:15,435 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 336 [2019-01-11 11:08:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:15,435 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2019-01-11 11:08:15,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-11 11:08:15,435 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2019-01-11 11:08:15,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2019-01-11 11:08:15,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:15,436 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1] [2019-01-11 11:08:15,436 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:15,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:15,437 INFO L82 PathProgramCache]: Analyzing trace with hash -218967535, now seen corresponding path program 67 times [2019-01-11 11:08:15,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:15,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:15,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:18,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:18,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:18,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:18,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:18,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:18,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:18,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:18,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:08:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:18,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:18,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:18,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:18,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:18,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:21,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:25,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:25,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-11 11:08:25,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:25,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-11 11:08:25,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-11 11:08:25,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12163, Invalid=17593, Unknown=0, NotChecked=0, Total=29756 [2019-01-11 11:08:25,897 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 140 states. [2019-01-11 11:08:30,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:30,554 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2019-01-11 11:08:30,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-11 11:08:30,554 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 341 [2019-01-11 11:08:30,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:30,555 INFO L225 Difference]: With dead ends: 351 [2019-01-11 11:08:30,555 INFO L226 Difference]: Without dead ends: 350 [2019-01-11 11:08:30,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 818 GetRequests, 543 SyntacticMatches, 36 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23870 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=21649, Invalid=36191, Unknown=0, NotChecked=0, Total=57840 [2019-01-11 11:08:30,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-01-11 11:08:30,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 347. [2019-01-11 11:08:30,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-01-11 11:08:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2019-01-11 11:08:30,644 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 341 [2019-01-11 11:08:30,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:30,645 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2019-01-11 11:08:30,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-11 11:08:30,645 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2019-01-11 11:08:30,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-01-11 11:08:30,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:30,646 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1] [2019-01-11 11:08:30,646 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:30,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:30,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1914538969, now seen corresponding path program 68 times [2019-01-11 11:08:30,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:30,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:08:30,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:30,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:33,525 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:33,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:33,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:33,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:33,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:33,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:33,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:33,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:08:33,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:08:34,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-11 11:08:34,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:34,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:34,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:34,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:34,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:34,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:37,076 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:37,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:41,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-11 11:08:41,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:41,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-11 11:08:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-11 11:08:41,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12266, Invalid=17836, Unknown=0, NotChecked=0, Total=30102 [2019-01-11 11:08:41,570 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 142 states. [2019-01-11 11:08:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:08:46,473 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2019-01-11 11:08:46,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-11 11:08:46,474 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 346 [2019-01-11 11:08:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:08:46,475 INFO L225 Difference]: With dead ends: 356 [2019-01-11 11:08:46,475 INFO L226 Difference]: Without dead ends: 355 [2019-01-11 11:08:46,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 551 SyntacticMatches, 38 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24507 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21926, Invalid=36880, Unknown=0, NotChecked=0, Total=58806 [2019-01-11 11:08:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2019-01-11 11:08:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 352. [2019-01-11 11:08:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-01-11 11:08:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2019-01-11 11:08:46,566 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 346 [2019-01-11 11:08:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:08:46,567 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2019-01-11 11:08:46,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-11 11:08:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2019-01-11 11:08:46,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-01-11 11:08:46,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:08:46,568 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1] [2019-01-11 11:08:46,568 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:08:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:08:46,569 INFO L82 PathProgramCache]: Analyzing trace with hash 116568017, now seen corresponding path program 69 times [2019-01-11 11:08:46,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:08:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:46,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:08:46,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:08:46,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:08:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:08:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:49,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:49,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:08:49,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:08:49,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:08:49,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:08:49,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:08:49,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:08:49,536 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:08:49,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:08:49,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:08:49,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:08:49,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:08:49,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:08:49,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:08:49,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:08:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:52,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:08:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:08:57,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:08:57,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-11 11:08:57,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:08:57,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-11 11:08:57,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-11 11:08:57,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12369, Invalid=18081, Unknown=0, NotChecked=0, Total=30450 [2019-01-11 11:08:57,310 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 144 states. [2019-01-11 11:09:02,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:02,242 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2019-01-11 11:09:02,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-11 11:09:02,242 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 351 [2019-01-11 11:09:02,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:02,244 INFO L225 Difference]: With dead ends: 361 [2019-01-11 11:09:02,244 INFO L226 Difference]: Without dead ends: 360 [2019-01-11 11:09:02,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 559 SyntacticMatches, 40 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25146 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=22204, Invalid=37576, Unknown=0, NotChecked=0, Total=59780 [2019-01-11 11:09:02,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-01-11 11:09:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 357. [2019-01-11 11:09:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-01-11 11:09:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2019-01-11 11:09:02,336 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 351 [2019-01-11 11:09:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:02,336 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2019-01-11 11:09:02,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-11 11:09:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2019-01-11 11:09:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-01-11 11:09:02,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:02,338 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1] [2019-01-11 11:09:02,338 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:02,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2014892441, now seen corresponding path program 70 times [2019-01-11 11:09:02,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:02,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:02,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:02,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:02,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:05,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:05,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:05,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:05,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:05,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:05,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:05,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:05,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:05,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:05,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:05,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:05,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:05,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:09,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:13,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:13,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-11 11:09:13,265 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:13,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-11 11:09:13,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-11 11:09:13,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12472, Invalid=18328, Unknown=0, NotChecked=0, Total=30800 [2019-01-11 11:09:13,268 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 146 states. [2019-01-11 11:09:18,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:18,212 INFO L93 Difference]: Finished difference Result 366 states and 366 transitions. [2019-01-11 11:09:18,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-11 11:09:18,212 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 356 [2019-01-11 11:09:18,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:18,213 INFO L225 Difference]: With dead ends: 366 [2019-01-11 11:09:18,214 INFO L226 Difference]: Without dead ends: 365 [2019-01-11 11:09:18,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 854 GetRequests, 567 SyntacticMatches, 42 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25787 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22483, Invalid=38279, Unknown=0, NotChecked=0, Total=60762 [2019-01-11 11:09:18,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2019-01-11 11:09:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2019-01-11 11:09:18,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-01-11 11:09:18,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2019-01-11 11:09:18,308 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 356 [2019-01-11 11:09:18,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:18,309 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2019-01-11 11:09:18,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-11 11:09:18,309 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2019-01-11 11:09:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-01-11 11:09:18,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:18,310 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1] [2019-01-11 11:09:18,310 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash -2113380975, now seen corresponding path program 71 times [2019-01-11 11:09:18,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:18,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:18,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:18,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:21,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:21,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:21,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:21,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:21,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:21,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:21,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:09:21,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:09:22,011 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-11 11:09:22,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:22,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:22,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:22,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:22,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:22,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:25,416 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:25,417 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:29,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:29,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-11 11:09:29,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:29,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-11 11:09:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-11 11:09:29,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12575, Invalid=18577, Unknown=0, NotChecked=0, Total=31152 [2019-01-11 11:09:29,894 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 148 states. [2019-01-11 11:09:34,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:34,960 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2019-01-11 11:09:34,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-11 11:09:34,960 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 361 [2019-01-11 11:09:34,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:34,961 INFO L225 Difference]: With dead ends: 371 [2019-01-11 11:09:34,961 INFO L226 Difference]: Without dead ends: 370 [2019-01-11 11:09:34,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 866 GetRequests, 575 SyntacticMatches, 44 SemanticMatches, 247 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26430 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=22763, Invalid=38989, Unknown=0, NotChecked=0, Total=61752 [2019-01-11 11:09:34,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-01-11 11:09:35,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 367. [2019-01-11 11:09:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-01-11 11:09:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2019-01-11 11:09:35,058 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 361 [2019-01-11 11:09:35,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:35,058 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2019-01-11 11:09:35,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-11 11:09:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2019-01-11 11:09:35,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-01-11 11:09:35,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:35,060 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1] [2019-01-11 11:09:35,060 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:35,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:35,060 INFO L82 PathProgramCache]: Analyzing trace with hash 804788391, now seen corresponding path program 72 times [2019-01-11 11:09:35,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:35,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:35,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:35,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:37,798 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:37,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:37,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:37,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:37,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:37,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:37,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:37,807 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:09:37,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:09:38,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:09:38,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:09:38,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:38,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:38,084 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:38,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:38,092 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:41,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:09:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:46,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:09:46,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-11 11:09:46,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:09:46,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-11 11:09:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-11 11:09:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12678, Invalid=18828, Unknown=0, NotChecked=0, Total=31506 [2019-01-11 11:09:46,049 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 150 states. [2019-01-11 11:09:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:09:51,242 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2019-01-11 11:09:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-11 11:09:51,243 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 366 [2019-01-11 11:09:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:09:51,244 INFO L225 Difference]: With dead ends: 376 [2019-01-11 11:09:51,244 INFO L226 Difference]: Without dead ends: 375 [2019-01-11 11:09:51,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 583 SyntacticMatches, 46 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27075 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23044, Invalid=39706, Unknown=0, NotChecked=0, Total=62750 [2019-01-11 11:09:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-01-11 11:09:51,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 372. [2019-01-11 11:09:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2019-01-11 11:09:51,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2019-01-11 11:09:51,344 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 366 [2019-01-11 11:09:51,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:09:51,344 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2019-01-11 11:09:51,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-11 11:09:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2019-01-11 11:09:51,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-01-11 11:09:51,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:09:51,346 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1, 1] [2019-01-11 11:09:51,346 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:09:51,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:09:51,346 INFO L82 PathProgramCache]: Analyzing trace with hash 523230033, now seen corresponding path program 73 times [2019-01-11 11:09:51,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:09:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:51,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:09:51,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:09:51,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:09:51,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:54,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:54,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:09:54,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:09:54,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:09:54,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:09:54,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:09:54,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:09:54,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:09:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:09:54,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:09:54,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:09:54,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:09:54,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:09:54,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:09:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:09:58,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:02,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:02,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-11 11:10:02,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:02,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-11 11:10:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-11 11:10:02,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12781, Invalid=19081, Unknown=0, NotChecked=0, Total=31862 [2019-01-11 11:10:02,425 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 152 states. [2019-01-11 11:10:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:07,732 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2019-01-11 11:10:07,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-11 11:10:07,732 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 371 [2019-01-11 11:10:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:07,733 INFO L225 Difference]: With dead ends: 381 [2019-01-11 11:10:07,733 INFO L226 Difference]: Without dead ends: 380 [2019-01-11 11:10:07,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 591 SyntacticMatches, 48 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27722 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23326, Invalid=40430, Unknown=0, NotChecked=0, Total=63756 [2019-01-11 11:10:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-01-11 11:10:07,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2019-01-11 11:10:07,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-01-11 11:10:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2019-01-11 11:10:07,836 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 371 [2019-01-11 11:10:07,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:07,837 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2019-01-11 11:10:07,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-11 11:10:07,837 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2019-01-11 11:10:07,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2019-01-11 11:10:07,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:07,838 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1, 1] [2019-01-11 11:10:07,838 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1217999591, now seen corresponding path program 74 times [2019-01-11 11:10:07,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:07,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:07,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:07,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:10,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:10,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:10,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:10,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:10,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:10,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:10,871 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:10:10,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:10:11,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-11 11:10:11,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:11,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:11,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:11,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:11,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:11,570 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:15,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:19,428 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:19,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:19,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-11 11:10:19,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:19,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-11 11:10:19,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-11 11:10:19,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12884, Invalid=19336, Unknown=0, NotChecked=0, Total=32220 [2019-01-11 11:10:19,451 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 154 states. [2019-01-11 11:10:24,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:24,963 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2019-01-11 11:10:24,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-11 11:10:24,963 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 376 [2019-01-11 11:10:24,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:24,965 INFO L225 Difference]: With dead ends: 386 [2019-01-11 11:10:24,965 INFO L226 Difference]: Without dead ends: 385 [2019-01-11 11:10:24,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 902 GetRequests, 599 SyntacticMatches, 50 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28371 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23609, Invalid=41161, Unknown=0, NotChecked=0, Total=64770 [2019-01-11 11:10:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-01-11 11:10:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 382. [2019-01-11 11:10:25,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-01-11 11:10:25,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2019-01-11 11:10:25,075 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 376 [2019-01-11 11:10:25,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:25,075 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2019-01-11 11:10:25,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-11 11:10:25,075 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2019-01-11 11:10:25,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-01-11 11:10:25,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:25,077 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1, 1] [2019-01-11 11:10:25,077 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:25,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:25,077 INFO L82 PathProgramCache]: Analyzing trace with hash 241510673, now seen corresponding path program 75 times [2019-01-11 11:10:25,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:25,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:25,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:25,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:28,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:28,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:28,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:28,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:28,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:28,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:28,136 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:10:28,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:10:28,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:10:28,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:10:28,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:28,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:28,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:28,422 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:32,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:36,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:36,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-11 11:10:36,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:36,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-11 11:10:36,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-11 11:10:36,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12987, Invalid=19593, Unknown=0, NotChecked=0, Total=32580 [2019-01-11 11:10:36,695 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 156 states. [2019-01-11 11:10:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:42,391 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2019-01-11 11:10:42,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-11 11:10:42,391 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 381 [2019-01-11 11:10:42,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:42,393 INFO L225 Difference]: With dead ends: 391 [2019-01-11 11:10:42,393 INFO L226 Difference]: Without dead ends: 390 [2019-01-11 11:10:42,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 914 GetRequests, 607 SyntacticMatches, 52 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29022 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=23893, Invalid=41899, Unknown=0, NotChecked=0, Total=65792 [2019-01-11 11:10:42,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-01-11 11:10:42,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2019-01-11 11:10:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2019-01-11 11:10:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2019-01-11 11:10:42,508 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 381 [2019-01-11 11:10:42,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:42,508 INFO L480 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2019-01-11 11:10:42,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-11 11:10:42,508 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2019-01-11 11:10:42,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-01-11 11:10:42,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:42,510 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1, 1] [2019-01-11 11:10:42,510 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:42,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:42,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1062108455, now seen corresponding path program 76 times [2019-01-11 11:10:42,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:42,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:10:42,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:42,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:10:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:45,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:45,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:10:45,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:10:45,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:10:45,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:10:45,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:10:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:45,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:10:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:10:45,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:10:45,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:10:45,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:10:45,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:10:45,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:10:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:49,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:10:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:10:54,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:10:54,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-11 11:10:54,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:10:54,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-11 11:10:54,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-11 11:10:54,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13090, Invalid=19852, Unknown=0, NotChecked=0, Total=32942 [2019-01-11 11:10:54,139 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 158 states. [2019-01-11 11:10:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:10:59,819 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2019-01-11 11:10:59,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-11 11:10:59,819 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 386 [2019-01-11 11:10:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:10:59,821 INFO L225 Difference]: With dead ends: 396 [2019-01-11 11:10:59,821 INFO L226 Difference]: Without dead ends: 395 [2019-01-11 11:10:59,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 615 SyntacticMatches, 54 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29675 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=24178, Invalid=42644, Unknown=0, NotChecked=0, Total=66822 [2019-01-11 11:10:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-01-11 11:10:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2019-01-11 11:10:59,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2019-01-11 11:10:59,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2019-01-11 11:10:59,935 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 386 [2019-01-11 11:10:59,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:10:59,936 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2019-01-11 11:10:59,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-11 11:10:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2019-01-11 11:10:59,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-01-11 11:10:59,937 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:10:59,937 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1, 1] [2019-01-11 11:10:59,937 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:10:59,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:10:59,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1264302383, now seen corresponding path program 77 times [2019-01-11 11:10:59,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:10:59,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:59,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:10:59,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:10:59,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:03,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:03,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:03,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:03,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:03,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:03,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:03,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:11:04,051 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-11 11:11:04,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:04,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:04,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:04,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:04,086 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:08,022 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:08,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:12,560 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:12,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:12,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-11 11:11:12,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:12,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-11 11:11:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-11 11:11:12,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13193, Invalid=20113, Unknown=0, NotChecked=0, Total=33306 [2019-01-11 11:11:12,585 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 160 states. [2019-01-11 11:11:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:18,520 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2019-01-11 11:11:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-11 11:11:18,521 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 391 [2019-01-11 11:11:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:18,522 INFO L225 Difference]: With dead ends: 401 [2019-01-11 11:11:18,522 INFO L226 Difference]: Without dead ends: 400 [2019-01-11 11:11:18,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 938 GetRequests, 623 SyntacticMatches, 56 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30330 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=24464, Invalid=43396, Unknown=0, NotChecked=0, Total=67860 [2019-01-11 11:11:18,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2019-01-11 11:11:18,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 397. [2019-01-11 11:11:18,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-11 11:11:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 397 transitions. [2019-01-11 11:11:18,636 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 397 transitions. Word has length 391 [2019-01-11 11:11:18,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:18,636 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 397 transitions. [2019-01-11 11:11:18,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-11 11:11:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 397 transitions. [2019-01-11 11:11:18,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2019-01-11 11:11:18,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:18,637 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1, 1] [2019-01-11 11:11:18,638 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1822160743, now seen corresponding path program 78 times [2019-01-11 11:11:18,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:18,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:18,639 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:18,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:18,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:22,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:22,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:22,076 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:22,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:22,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:22,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:22,086 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:11:22,086 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:11:22,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:11:22,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:11:22,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:22,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:22,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:22,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:26,188 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:26,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:30,906 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:30,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:30,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-11 11:11:30,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:30,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-11 11:11:30,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-11 11:11:30,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13296, Invalid=20376, Unknown=0, NotChecked=0, Total=33672 [2019-01-11 11:11:30,930 INFO L87 Difference]: Start difference. First operand 397 states and 397 transitions. Second operand 162 states. [2019-01-11 11:11:37,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:37,106 INFO L93 Difference]: Finished difference Result 406 states and 406 transitions. [2019-01-11 11:11:37,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-11 11:11:37,106 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 396 [2019-01-11 11:11:37,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:37,108 INFO L225 Difference]: With dead ends: 406 [2019-01-11 11:11:37,108 INFO L226 Difference]: Without dead ends: 405 [2019-01-11 11:11:37,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 950 GetRequests, 631 SyntacticMatches, 58 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30987 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24751, Invalid=44155, Unknown=0, NotChecked=0, Total=68906 [2019-01-11 11:11:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2019-01-11 11:11:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 402. [2019-01-11 11:11:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2019-01-11 11:11:37,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2019-01-11 11:11:37,224 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 396 [2019-01-11 11:11:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:37,224 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2019-01-11 11:11:37,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-11 11:11:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2019-01-11 11:11:37,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-01-11 11:11:37,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:37,225 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1, 1] [2019-01-11 11:11:37,226 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:37,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:37,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1810445457, now seen corresponding path program 79 times [2019-01-11 11:11:37,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:37,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:11:37,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:37,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:40,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:40,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:40,495 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:40,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:40,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:40,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:40,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:40,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:40,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:11:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:40,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:11:40,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:11:40,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:11:40,779 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:11:44,897 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:44,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:11:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:49,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:11:49,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-11 11:11:49,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:11:49,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-11 11:11:49,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-11 11:11:49,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13399, Invalid=20641, Unknown=0, NotChecked=0, Total=34040 [2019-01-11 11:11:49,601 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 164 states. [2019-01-11 11:11:55,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:11:55,660 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2019-01-11 11:11:55,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-11 11:11:55,660 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 401 [2019-01-11 11:11:55,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:11:55,662 INFO L225 Difference]: With dead ends: 411 [2019-01-11 11:11:55,662 INFO L226 Difference]: Without dead ends: 410 [2019-01-11 11:11:55,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 962 GetRequests, 639 SyntacticMatches, 60 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31646 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25039, Invalid=44921, Unknown=0, NotChecked=0, Total=69960 [2019-01-11 11:11:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-01-11 11:11:55,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2019-01-11 11:11:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-01-11 11:11:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2019-01-11 11:11:55,781 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 401 [2019-01-11 11:11:55,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:11:55,781 INFO L480 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2019-01-11 11:11:55,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-11 11:11:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2019-01-11 11:11:55,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2019-01-11 11:11:55,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:11:55,783 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1, 1] [2019-01-11 11:11:55,784 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:11:55,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:11:55,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1409655207, now seen corresponding path program 80 times [2019-01-11 11:11:55,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:11:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:11:55,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:11:55,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:11:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:11:59,324 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:11:59,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:59,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:11:59,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:11:59,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:11:59,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:11:59,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:11:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:11:59,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:12:00,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-11 11:12:00,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:00,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:00,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:00,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:00,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:00,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:04,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:04,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:08,946 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:08,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:08,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-11 11:12:08,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:08,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-11 11:12:08,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-11 11:12:08,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13502, Invalid=20908, Unknown=0, NotChecked=0, Total=34410 [2019-01-11 11:12:08,971 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 166 states. [2019-01-11 11:12:15,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:15,377 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2019-01-11 11:12:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-11 11:12:15,378 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 406 [2019-01-11 11:12:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:15,379 INFO L225 Difference]: With dead ends: 416 [2019-01-11 11:12:15,379 INFO L226 Difference]: Without dead ends: 415 [2019-01-11 11:12:15,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 974 GetRequests, 647 SyntacticMatches, 62 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32307 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=25328, Invalid=45694, Unknown=0, NotChecked=0, Total=71022 [2019-01-11 11:12:15,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-01-11 11:12:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 412. [2019-01-11 11:12:15,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2019-01-11 11:12:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2019-01-11 11:12:15,508 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 406 [2019-01-11 11:12:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:15,509 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2019-01-11 11:12:15,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-11 11:12:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2019-01-11 11:12:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2019-01-11 11:12:15,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:15,510 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1, 1] [2019-01-11 11:12:15,510 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:12:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1127215697, now seen corresponding path program 81 times [2019-01-11 11:12:15,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:15,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:15,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:15,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:19,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:19,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:19,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:19,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:19,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:19,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:19,115 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:12:19,115 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:12:19,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:12:19,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:19,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:19,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:19,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:19,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:19,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:23,829 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:23,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:28,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:28,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-11 11:12:28,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:28,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-11 11:12:28,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-11 11:12:28,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13605, Invalid=21177, Unknown=0, NotChecked=0, Total=34782 [2019-01-11 11:12:28,328 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 168 states. [2019-01-11 11:12:34,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:34,812 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2019-01-11 11:12:34,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-11 11:12:34,813 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 411 [2019-01-11 11:12:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:34,814 INFO L225 Difference]: With dead ends: 421 [2019-01-11 11:12:34,814 INFO L226 Difference]: Without dead ends: 420 [2019-01-11 11:12:34,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 986 GetRequests, 655 SyntacticMatches, 64 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32970 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=25618, Invalid=46474, Unknown=0, NotChecked=0, Total=72092 [2019-01-11 11:12:34,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-01-11 11:12:34,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 417. [2019-01-11 11:12:34,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-01-11 11:12:34,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2019-01-11 11:12:34,942 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 411 [2019-01-11 11:12:34,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:34,943 INFO L480 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2019-01-11 11:12:34,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-11 11:12:34,943 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2019-01-11 11:12:34,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-01-11 11:12:34,944 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:34,944 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1, 1] [2019-01-11 11:12:34,945 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:12:34,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:34,945 INFO L82 PathProgramCache]: Analyzing trace with hash -468747289, now seen corresponding path program 82 times [2019-01-11 11:12:34,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:34,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:12:34,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:34,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:38,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:38,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:38,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:38,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:38,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:38,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:38,489 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:38,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:38,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:12:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:38,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:38,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:38,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:38,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:38,777 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:12:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:42,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:12:47,592 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:47,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:12:47,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-11 11:12:47,612 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:12:47,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-11 11:12:47,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-11 11:12:47,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13708, Invalid=21448, Unknown=0, NotChecked=0, Total=35156 [2019-01-11 11:12:47,615 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 170 states. [2019-01-11 11:12:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:12:54,423 INFO L93 Difference]: Finished difference Result 426 states and 426 transitions. [2019-01-11 11:12:54,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-11 11:12:54,423 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 416 [2019-01-11 11:12:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:12:54,425 INFO L225 Difference]: With dead ends: 426 [2019-01-11 11:12:54,425 INFO L226 Difference]: Without dead ends: 425 [2019-01-11 11:12:54,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 998 GetRequests, 663 SyntacticMatches, 66 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33635 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=25909, Invalid=47261, Unknown=0, NotChecked=0, Total=73170 [2019-01-11 11:12:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-01-11 11:12:54,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2019-01-11 11:12:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-01-11 11:12:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2019-01-11 11:12:54,559 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 416 [2019-01-11 11:12:54,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:12:54,560 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2019-01-11 11:12:54,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-11 11:12:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2019-01-11 11:12:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-01-11 11:12:54,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:12:54,563 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1, 1] [2019-01-11 11:12:54,563 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:12:54,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:12:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1099661295, now seen corresponding path program 83 times [2019-01-11 11:12:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:12:54,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:54,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:12:54,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:12:54,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:12:54,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:12:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:12:58,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:58,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:12:58,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:12:58,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:12:58,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:12:58,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:12:58,432 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 11:12:58,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 11:12:59,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-11 11:12:59,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:12:59,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:12:59,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:12:59,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,284 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:12:59,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:13:03,537 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:03,537 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:08,255 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:08,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:08,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-11 11:13:08,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:08,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-11 11:13:08,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-11 11:13:08,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13811, Invalid=21721, Unknown=0, NotChecked=0, Total=35532 [2019-01-11 11:13:08,281 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 172 states. [2019-01-11 11:13:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:15,155 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2019-01-11 11:13:15,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-11 11:13:15,155 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 421 [2019-01-11 11:13:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:15,157 INFO L225 Difference]: With dead ends: 431 [2019-01-11 11:13:15,157 INFO L226 Difference]: Without dead ends: 430 [2019-01-11 11:13:15,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 671 SyntacticMatches, 68 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34302 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=26201, Invalid=48055, Unknown=0, NotChecked=0, Total=74256 [2019-01-11 11:13:15,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-01-11 11:13:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 427. [2019-01-11 11:13:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2019-01-11 11:13:15,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2019-01-11 11:13:15,297 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 421 [2019-01-11 11:13:15,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:15,297 INFO L480 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2019-01-11 11:13:15,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-11 11:13:15,298 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2019-01-11 11:13:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-01-11 11:13:15,299 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:15,299 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1, 1] [2019-01-11 11:13:15,300 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:13:15,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:15,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1237481945, now seen corresponding path program 84 times [2019-01-11 11:13:15,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:15,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:15,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:15,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:19,057 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:19,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:19,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:19,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:19,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:19,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:19,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:19,065 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 11:13:19,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 11:13:19,355 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 11:13:19,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 11:13:19,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:19,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:13:19,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:19,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:13:23,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:23,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:28,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:28,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 189 [2019-01-11 11:13:28,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:28,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-11 11:13:28,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-11 11:13:28,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13914, Invalid=21996, Unknown=0, NotChecked=0, Total=35910 [2019-01-11 11:13:28,497 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 174 states. [2019-01-11 11:13:35,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:35,518 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2019-01-11 11:13:35,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-11 11:13:35,519 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 426 [2019-01-11 11:13:35,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:35,520 INFO L225 Difference]: With dead ends: 436 [2019-01-11 11:13:35,520 INFO L226 Difference]: Without dead ends: 435 [2019-01-11 11:13:35,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1022 GetRequests, 679 SyntacticMatches, 70 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34971 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=26494, Invalid=48856, Unknown=0, NotChecked=0, Total=75350 [2019-01-11 11:13:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-11 11:13:35,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 432. [2019-01-11 11:13:35,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2019-01-11 11:13:35,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2019-01-11 11:13:35,698 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 426 [2019-01-11 11:13:35,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:35,698 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2019-01-11 11:13:35,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-11 11:13:35,698 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2019-01-11 11:13:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2019-01-11 11:13:35,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:35,700 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1, 1] [2019-01-11 11:13:35,700 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:13:35,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:35,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1766662703, now seen corresponding path program 85 times [2019-01-11 11:13:35,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:35,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 11:13:35,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:35,701 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:39,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 11:13:39,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 11:13:39,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 11:13:39,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 11:13:39,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 11:13:39,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:39,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 11:13:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 11:13:39,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 11:13:39,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 11:13:39,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 11:13:39,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-11 11:13:44,411 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:44,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 11:13:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 11:13:49,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 11:13:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 190 [2019-01-11 11:13:49,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 11:13:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-01-11 11:13:49,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-01-11 11:13:49,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14017, Invalid=22273, Unknown=0, NotChecked=0, Total=36290 [2019-01-11 11:13:49,181 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 176 states. [2019-01-11 11:13:56,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 11:13:56,260 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2019-01-11 11:13:56,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-11 11:13:56,260 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 431 [2019-01-11 11:13:56,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 11:13:56,262 INFO L225 Difference]: With dead ends: 441 [2019-01-11 11:13:56,262 INFO L226 Difference]: Without dead ends: 440 [2019-01-11 11:13:56,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1034 GetRequests, 687 SyntacticMatches, 72 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35642 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=26788, Invalid=49664, Unknown=0, NotChecked=0, Total=76452 [2019-01-11 11:13:56,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-01-11 11:13:56,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 437. [2019-01-11 11:13:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-01-11 11:13:56,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 437 transitions. [2019-01-11 11:13:56,402 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 437 transitions. Word has length 431 [2019-01-11 11:13:56,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 11:13:56,402 INFO L480 AbstractCegarLoop]: Abstraction has 437 states and 437 transitions. [2019-01-11 11:13:56,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-01-11 11:13:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 437 transitions. [2019-01-11 11:13:56,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2019-01-11 11:13:56,404 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 11:13:56,404 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 87, 86, 86, 1, 1, 1] [2019-01-11 11:13:56,404 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-11 11:13:56,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 11:13:56,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1326694503, now seen corresponding path program 86 times [2019-01-11 11:13:56,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 11:13:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 11:13:56,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 11:13:56,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 11:13:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat