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-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:34,051 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:34,052 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:34,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:34,066 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:34,067 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:34,068 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:34,070 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:34,072 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:34,072 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:34,073 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:34,074 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:34,075 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:34,076 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:34,077 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:34,078 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:34,079 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:34,080 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:34,082 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:34,083 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:34,085 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:34,086 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:34,088 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:34,088 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:34,088 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:34,089 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:34,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:34,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:34,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:34,093 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:34,093 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:34,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:34,094 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:34,094 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:34,095 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:34,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:34,096 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-02-25 15:10:34,109 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:34,109 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:34,110 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:34,110 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:34,110 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:34,111 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:34,111 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:34,111 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:34,111 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:34,111 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:34,112 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:34,112 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:34,112 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:34,112 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:34,113 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:34,113 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:34,113 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:34,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:34,113 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:34,114 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:34,114 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:34,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:34,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:34,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:34,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:34,115 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:34,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:34,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:34,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:34,116 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:34,116 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:34,116 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:34,116 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:34,116 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:34,117 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:34,117 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:34,117 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:34,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:34,117 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:34,118 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:34,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:34,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:34,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:34,187 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:34,187 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:34,188 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-02-25 15:10:34,189 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-02-25 15:10:34,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:34,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:34,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:34,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:34,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:34,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,271 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,280 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-25 15:10:34,280 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-25 15:10:34,280 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-25 15:10:34,299 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:34,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:34,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:34,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:34,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,324 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... [2019-02-25 15:10:34,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:34,326 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:34,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:34,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:34,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-25 15:10:34,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-25 15:10:34,404 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-25 15:10:34,582 INFO L278 CfgBuilder]: Using library mode [2019-02-25 15:10:34,583 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-25 15:10:34,584 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:34 BoogieIcfgContainer [2019-02-25 15:10:34,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:34,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:34,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:34,588 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:34,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:34" (1/2) ... [2019-02-25 15:10:34,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c0a575 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:34, skipping insertion in model container [2019-02-25 15:10:34,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:34" (2/2) ... [2019-02-25 15:10:34,592 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-02-25 15:10:34,601 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:34,609 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:34,626 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:34,662 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:34,662 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:34,663 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:34,663 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:34,663 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:34,663 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:34,663 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:34,663 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:34,679 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-25 15:10:34,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:10:34,685 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:10:34,688 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,699 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-25 15:10:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:34,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,756 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:34,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:34,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-25 15:10:34,937 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:34,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:34,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:34,962 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-25 15:10:35,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:35,109 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-02-25 15:10:35,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:35,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:10:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:35,127 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:10:35,128 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:10:35,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-02-25 15:10:35,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:10:35,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-02-25 15:10:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:10:35,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:10:35,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-02-25 15:10:35,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:35,176 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:10:35,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:35,177 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:10:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:10:35,177 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:35,178 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-25 15:10:35,178 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,179 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-02-25 15:10:35,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:35,314 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-25 15:10:35,316 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2019-02-25 15:10:35,353 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:35,353 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:35,476 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:35,478 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 3. Performed 84 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-02-25 15:10:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:35,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:35,485 INFO 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-02-25 15:10:35,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:35,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:10:35,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:35,631 INFO L467 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-02-25 15:10:35,632 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,685 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:35,685 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:35,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,785 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:35,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-25 15:10:35,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:10:35,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:10:35,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:35,911 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-25 15:10:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:35,984 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-25 15:10:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:35,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-25 15:10:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:35,985 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:10:35,985 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:10:35,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:35,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:10:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-25 15:10:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:10:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-25 15:10:35,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-02-25 15:10:35,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:35,990 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-25 15:10:35,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:10:35,991 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-25 15:10:35,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:35,991 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:35,991 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-02-25 15:10:35,992 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:35,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:35,992 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-02-25 15:10:35,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:35,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:35,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:35,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,262 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,264 INFO 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-02-25 15:10:36,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:36,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:36,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-25 15:10:36,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,331 INFO L467 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-02-25 15:10:36,331 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,364 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,364 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:36,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:36,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-25 15:10:36,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:36,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:36,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:36,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:36,576 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-02-25 15:10:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,751 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:10:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:36,751 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-25 15:10:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,752 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:10:36,752 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:10:36,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-25 15:10:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:10:36,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-25 15:10:36,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:10:36,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:10:36,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-02-25 15:10:36,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,758 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:10:36,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:36,758 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:10:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:10:36,759 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,759 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-02-25 15:10:36,759 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-02-25 15:10:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:36,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,861 INFO 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-02-25 15:10:36,874 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:36,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:36,893 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:36,893 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:36,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,902 INFO L467 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-02-25 15:10:36,903 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,912 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:36,913 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:37,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-25 15:10:37,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:37,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:37,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:37,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:37,099 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-02-25 15:10:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:37,417 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-25 15:10:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:37,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-02-25 15:10:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:37,418 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:10:37,418 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:10:37,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:37,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:10:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-25 15:10:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:10:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-25 15:10:37,423 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-02-25 15:10:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:37,423 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-25 15:10:37,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-25 15:10:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-25 15:10:37,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:37,424 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-02-25 15:10:37,425 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:37,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:37,425 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-02-25 15:10:37,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:37,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:37,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:10:37,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:37,611 INFO L467 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-02-25 15:10:37,611 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:37,625 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:37,626 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:37,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:37,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-25 15:10:37,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:37,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:10:37,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:10:37,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:37,861 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-02-25 15:10:37,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:37,914 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-25 15:10:37,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:37,925 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-02-25 15:10:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:37,926 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:10:37,926 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:10:37,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-25 15:10:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:10:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-02-25 15:10:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:10:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-25 15:10:37,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-02-25 15:10:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:37,932 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-25 15:10:37,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:10:37,932 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-25 15:10:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:10:37,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:37,933 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-02-25 15:10:37,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:37,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-02-25 15:10:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:38,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:38,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:38,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,060 INFO 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-02-25 15:10:38,069 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:38,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:38,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-25 15:10:38,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:38,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:10:38,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:38,096 INFO L467 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-02-25 15:10:38,097 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,107 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,108 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,233 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,399 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-25 15:10:38,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:38,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:38,419 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-02-25 15:10:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,470 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-25 15:10:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:38,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-02-25 15:10:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,472 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:10:38,472 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:10:38,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:10:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-25 15:10:38,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:10:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-25 15:10:38,478 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-02-25 15:10:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,478 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-25 15:10:38,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-25 15:10:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-25 15:10:38,479 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,479 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-02-25 15:10:38,480 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,480 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-02-25 15:10:38,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:38,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:38,706 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:38,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:38,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:38,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:38,708 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:10:38,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:38,718 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:38,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:38,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:38,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:10:38,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:38,742 INFO L467 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-02-25 15:10:38,743 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,757 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:38,758 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:38,884 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:38,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:39,022 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:39,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-25 15:10:39,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:39,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:10:39,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:10:39,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:10:39,042 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-02-25 15:10:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:39,100 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:10:39,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:10:39,100 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-02-25 15:10:39,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:39,102 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:10:39,102 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:10:39,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-25 15:10:39,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:10:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-25 15:10:39,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:10:39,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:10:39,109 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-02-25 15:10:39,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:39,109 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:10:39,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:10:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:10:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:10:39,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:39,110 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-02-25 15:10:39,111 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:39,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-02-25 15:10:39,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:39,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:39,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:39,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:39,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:10:39,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:39,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:10:39,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:39,300 INFO L467 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-02-25 15:10:39,301 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:39,306 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:39,307 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:39,502 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,502 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:39,658 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:39,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:39,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-25 15:10:39,677 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:39,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:10:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:10:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:39,680 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-02-25 15:10:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:39,967 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-25 15:10:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:39,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-02-25 15:10:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:39,968 INFO L225 Difference]: With dead ends: 30 [2019-02-25 15:10:39,969 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:10:39,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:10:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-25 15:10:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:10:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-25 15:10:39,974 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-02-25 15:10:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:39,974 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-25 15:10:39,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:10:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-25 15:10:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:10:39,976 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:39,976 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-02-25 15:10:39,976 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:39,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:39,976 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-02-25 15:10:39,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:39,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:39,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:39,977 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:40,131 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:40,132 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:40,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:40,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:40,132 INFO 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-02-25 15:10:40,149 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:40,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:40,174 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-25 15:10:40,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:40,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:10:40,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:40,193 INFO L467 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-02-25 15:10:40,193 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,208 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:40,209 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,333 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:40,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:40,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-25 15:10:40,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:40,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:10:40,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:10:40,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:10:40,509 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-02-25 15:10:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:40,666 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-25 15:10:40,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:10:40,667 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-02-25 15:10:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:40,668 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:10:40,668 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:10:40,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-25 15:10:40,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:10:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-02-25 15:10:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:10:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-25 15:10:40,676 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-02-25 15:10:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:40,676 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-25 15:10:40,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:10:40,676 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-25 15:10:40,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:10:40,678 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:40,679 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-02-25 15:10:40,679 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:40,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-02-25 15:10:40,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:40,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:40,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:41,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:41,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:41,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,001 INFO 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-02-25 15:10:41,013 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:41,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:41,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:41,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:41,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:10:41,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:41,055 INFO L467 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-02-25 15:10:41,056 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:41,063 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:41,063 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:41,830 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:41,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:41,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-25 15:10:41,850 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:41,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:10:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:10:41,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:41,852 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-02-25 15:10:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:41,936 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-25 15:10:41,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:10:41,937 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-02-25 15:10:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:41,938 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:10:41,938 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:10:41,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:41,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:10:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-25 15:10:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:10:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-25 15:10:41,944 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-02-25 15:10:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:41,944 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-25 15:10:41,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:10:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-25 15:10:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-25 15:10:41,945 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:41,945 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-02-25 15:10:41,945 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:41,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-02-25 15:10:41,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:41,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,946 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:41,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:41,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,110 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,111 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:42,111 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:42,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:42,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:42,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 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-02-25 15:10:42,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:42,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:42,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:10:42,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:42,166 INFO L467 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-02-25 15:10:42,167 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:42,262 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:42,263 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:42,595 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,595 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:42,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:42,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-25 15:10:42,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:42,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:10:42,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:10:42,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:10:42,817 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-02-25 15:10:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:42,902 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:10:42,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:10:42,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-02-25 15:10:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:42,905 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:10:42,905 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:10:42,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-25 15:10:42,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:10:42,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-25 15:10:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:10:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:10:42,911 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-02-25 15:10:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:42,911 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:10:42,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:10:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:10:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:10:42,912 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:42,912 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-02-25 15:10:42,913 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:42,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-02-25 15:10:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:42,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:42,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:43,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:43,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:43,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:43,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:43,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:43,284 INFO 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-02-25 15:10:43,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:43,294 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:43,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-25 15:10:43,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:43,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:10:43,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:43,366 INFO L467 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-02-25 15:10:43,367 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:43,372 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:43,372 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:43,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:43,958 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:43,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:43,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-25 15:10:43,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:43,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:43,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:43,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:43,978 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-02-25 15:10:44,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:44,066 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-25 15:10:44,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:10:44,067 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-02-25 15:10:44,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:44,068 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:10:44,068 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:10:44,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:44,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:10:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-25 15:10:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:10:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-25 15:10:44,075 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-02-25 15:10:44,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:44,075 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-25 15:10:44,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-25 15:10:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-25 15:10:44,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:44,076 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-02-25 15:10:44,076 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:44,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:44,076 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-02-25 15:10:44,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:44,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:44,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:44,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:44,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 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-02-25 15:10:44,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:44,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:44,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:44,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:44,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:10:44,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:44,298 INFO L467 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-02-25 15:10:44,298 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:44,310 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:44,310 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:44,497 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,498 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:44,780 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:44,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:44,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-25 15:10:44,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:44,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:10:44,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:10:44,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:10:44,800 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-02-25 15:10:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:44,893 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-25 15:10:44,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:10:44,894 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-02-25 15:10:44,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:44,895 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:10:44,895 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:10:44,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-25 15:10:44,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:10:44,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-02-25 15:10:44,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:10:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-25 15:10:44,901 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-02-25 15:10:44,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:44,901 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-25 15:10:44,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:10:44,902 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-25 15:10:44,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:10:44,902 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:44,902 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-02-25 15:10:44,903 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:44,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:44,903 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-02-25 15:10:44,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:44,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:44,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:45,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:45,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:45,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:45,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:45,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 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-02-25 15:10:45,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:45,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:45,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:45,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:10:45,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:45,148 INFO L467 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-02-25 15:10:45,149 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:45,169 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:45,169 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:45,457 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:46,237 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:46,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:46,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-25 15:10:46,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:46,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:10:46,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:10:46,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:46,258 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-02-25 15:10:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:46,390 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-25 15:10:46,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:10:46,390 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-02-25 15:10:46,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:46,392 INFO L225 Difference]: With dead ends: 48 [2019-02-25 15:10:46,392 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:10:46,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:10:46,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-25 15:10:46,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:10:46,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-25 15:10:46,399 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-02-25 15:10:46,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:46,400 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-25 15:10:46,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:10:46,400 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-25 15:10:46,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-25 15:10:46,400 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:46,401 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-02-25 15:10:46,401 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:46,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:46,401 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-02-25 15:10:46,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:46,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:46,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:46,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:46,904 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:46,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:46,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:46,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:46,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:46,905 INFO 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-02-25 15:10:46,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:46,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:46,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-25 15:10:46,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:46,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:10:46,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:47,009 INFO L467 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-02-25 15:10:47,010 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:47,016 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:47,017 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,339 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:47,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:47,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-25 15:10:47,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:47,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:47,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:10:47,819 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-02-25 15:10:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:48,035 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:10:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:10:48,036 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-02-25 15:10:48,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:48,036 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:10:48,037 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:10:48,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-25 15:10:48,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:10:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-25 15:10:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:10:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:10:48,042 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-02-25 15:10:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:48,042 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:10:48,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:10:48,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:10:48,043 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:48,043 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-02-25 15:10:48,044 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:48,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:48,044 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-02-25 15:10:48,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:48,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:48,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:48,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:48,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:48,275 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,276 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:48,276 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:48,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:48,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:48,276 INFO 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-02-25 15:10:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:48,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:48,302 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:48,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:48,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:10:48,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:48,315 INFO L467 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-02-25 15:10:48,316 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:48,324 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:48,324 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:48,547 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,548 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:48,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:48,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-25 15:10:48,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:48,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:10:48,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:10:48,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:48,929 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-02-25 15:10:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:49,036 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-25 15:10:49,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:10:49,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-02-25 15:10:49,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:49,037 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:10:49,037 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:10:49,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:49,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:10:49,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-25 15:10:49,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:10:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-25 15:10:49,044 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-02-25 15:10:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:49,044 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-25 15:10:49,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:10:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-25 15:10:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:10:49,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:49,045 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-02-25 15:10:49,046 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:49,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:49,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-02-25 15:10:49,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:49,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:49,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:49,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:49,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:49,756 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:49,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:49,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:49,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 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-02-25 15:10:49,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:49,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:49,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:10:49,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:49,796 INFO L467 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-02-25 15:10:49,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:49,805 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:49,805 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:50,630 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:50,631 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:51,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:51,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-25 15:10:51,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:51,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:10:51,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:10:51,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:10:51,966 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-02-25 15:10:52,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:52,096 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-25 15:10:52,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:10:52,097 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-02-25 15:10:52,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:52,098 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:10:52,098 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:10:52,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-25 15:10:52,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:10:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-02-25 15:10:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:10:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-25 15:10:52,104 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-02-25 15:10:52,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:52,104 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-25 15:10:52,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:10:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-25 15:10:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:10:52,106 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:52,106 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-02-25 15:10:52,106 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:52,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-02-25 15:10:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:52,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:52,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,838 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:52,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:52,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:52,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:52,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:10:52,847 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:52,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:52,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-25 15:10:52,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:52,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:10:52,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:52,892 INFO L467 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-02-25 15:10:52,892 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:52,900 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:52,901 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:53,178 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:53,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:53,613 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:53,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:53,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-25 15:10:53,631 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:53,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:10:53,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:10:53,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:53,633 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-02-25 15:10:53,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:53,750 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-25 15:10:53,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:10:53,750 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-02-25 15:10:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:53,751 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:10:53,751 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:10:53,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:53,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:10:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-25 15:10:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:10:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-25 15:10:53,757 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-02-25 15:10:53,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:53,757 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-25 15:10:53,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:10:53,757 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-25 15:10:53,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-25 15:10:53,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:53,758 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-02-25 15:10:53,759 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:53,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:53,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-02-25 15:10:53,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:53,760 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:53,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:53,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:54,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:54,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:54,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:54,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:10:54,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:54,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:54,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:54,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:54,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:10:54,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:54,151 INFO L467 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-02-25 15:10:54,151 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:54,163 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:54,163 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:54,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:55,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-25 15:10:55,088 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:55,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:10:55,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:10:55,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:10:55,090 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-02-25 15:10:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:55,208 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:10:55,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:10:55,208 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-02-25 15:10:55,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:55,209 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:10:55,210 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:10:55,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-25 15:10:55,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:10:55,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-25 15:10:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:10:55,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:10:55,216 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-02-25 15:10:55,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:55,216 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:10:55,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:10:55,217 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:10:55,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:10:55,217 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:55,217 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-02-25 15:10:55,218 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:55,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:55,218 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-02-25 15:10:55,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:55,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:55,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:55,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:55,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:55,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:55,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:55,485 INFO 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-02-25 15:10:55,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:55,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:55,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:10:55,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:55,524 INFO L467 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-02-25 15:10:55,525 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:55,534 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:55,535 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:55,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:56,576 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:56,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:56,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-25 15:10:56,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:56,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:10:56,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:10:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:56,596 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-02-25 15:10:56,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:56,746 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-25 15:10:56,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:10:56,747 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-02-25 15:10:56,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:56,748 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:10:56,748 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:10:56,749 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:56,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:10:56,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-25 15:10:56,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:10:56,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-25 15:10:56,754 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-02-25 15:10:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:56,754 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-25 15:10:56,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:10:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-25 15:10:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-25 15:10:56,755 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:56,756 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-02-25 15:10:56,756 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:56,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-02-25 15:10:56,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:56,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:56,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:57,060 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:57,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:57,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:57,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:57,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,061 INFO 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-02-25 15:10:57,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:57,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:57,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-25 15:10:57,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:57,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:10:57,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:57,134 INFO L467 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-02-25 15:10:57,135 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:57,141 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:57,142 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:57,610 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:58,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:58,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-25 15:10:58,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:58,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:10:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:10:58,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:10:58,245 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-02-25 15:10:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:58,419 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-25 15:10:58,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:10:58,420 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-02-25 15:10:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:58,421 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:10:58,421 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:10:58,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-25 15:10:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:10:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-02-25 15:10:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:10:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-25 15:10:58,427 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-02-25 15:10:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:58,428 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-25 15:10:58,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:10:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-25 15:10:58,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:10:58,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:58,429 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-02-25 15:10:58,429 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:58,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:58,429 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-02-25 15:10:58,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:58,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:58,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:58,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:58,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:58,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:58,879 INFO 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-02-25 15:10:58,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:58,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:58,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:58,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:58,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:10:58,913 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:58,917 INFO L467 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-02-25 15:10:58,917 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:10:58,921 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:10:58,922 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:10:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:59,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:59,977 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:00,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:00,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-25 15:11:00,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:00,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:11:00,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:11:00,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:11:00,004 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-02-25 15:11:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:00,135 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-25 15:11:00,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:11:00,138 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-02-25 15:11:00,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:00,139 INFO L225 Difference]: With dead ends: 72 [2019-02-25 15:11:00,139 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:11:00,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:11:00,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:11:00,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-25 15:11:00,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:11:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-25 15:11:00,143 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-02-25 15:11:00,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:00,144 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-25 15:11:00,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:11:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-25 15:11:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:11:00,145 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:00,145 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-02-25 15:11:00,145 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:00,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-02-25 15:11:00,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,146 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:00,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:00,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:00,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:00,822 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:00,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:00,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:00,822 INFO 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-02-25 15:11:00,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:00,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:00,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:00,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:11:00,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:00,871 INFO L467 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-02-25 15:11:00,871 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:00,882 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:00,883 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:01,529 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:01,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:02,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:02,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-25 15:11:02,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:02,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:11:02,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:11:02,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:11:02,334 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-02-25 15:11:02,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:02,506 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:11:02,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:11:02,506 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-02-25 15:11:02,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:02,507 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:11:02,507 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:11:02,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-25 15:11:02,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:11:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-25 15:11:02,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:11:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:11:02,512 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-02-25 15:11:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:02,513 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:11:02,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:11:02,513 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:11:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:11:02,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:02,514 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-02-25 15:11:02,514 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:02,514 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-02-25 15:11:02,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:02,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:02,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:02,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:02,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:02,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:02,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:02,897 INFO 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-02-25 15:11:02,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:02,905 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:02,951 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-25 15:11:02,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:02,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:11:02,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:02,956 INFO L467 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-02-25 15:11:02,956 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:02,977 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:02,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:03,373 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:04,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:04,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-25 15:11:04,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:04,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:04,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:04,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:04,155 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-02-25 15:11:04,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:04,324 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-25 15:11:04,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:11:04,325 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-02-25 15:11:04,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:04,326 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:11:04,326 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:11:04,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:04,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:11:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-25 15:11:04,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-25 15:11:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-25 15:11:04,330 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-02-25 15:11:04,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:04,331 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-25 15:11:04,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:04,331 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-25 15:11:04,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-25 15:11:04,331 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:04,332 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-02-25 15:11:04,332 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:04,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:04,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-02-25 15:11:04,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:04,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:04,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:04,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:04,721 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:04,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:04,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:04,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:04,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:04,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:11:04,730 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:04,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:04,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:04,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:04,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:11:04,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:04,759 INFO L467 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-02-25 15:11:04,759 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:04,769 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:04,769 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:05,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:06,053 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:06,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:06,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-25 15:11:06,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:06,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:11:06,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:11:06,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:11:06,072 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-02-25 15:11:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:06,321 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-25 15:11:06,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:11:06,321 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-02-25 15:11:06,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:06,322 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:11:06,322 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:11:06,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-25 15:11:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:11:06,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-02-25 15:11:06,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:11:06,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-25 15:11:06,326 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-02-25 15:11:06,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:06,326 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-25 15:11:06,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:11:06,327 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-25 15:11:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:11:06,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:06,327 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-02-25 15:11:06,328 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:06,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:06,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-02-25 15:11:06,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:06,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:06,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:06,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:06,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:06,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:06,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:06,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:06,802 INFO 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-02-25 15:11:06,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:06,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:06,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:11:06,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:06,840 INFO L467 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-02-25 15:11:06,840 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:06,853 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:06,853 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:07,326 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:07,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:08,258 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:08,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:08,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-25 15:11:08,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:08,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:11:08,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:11:08,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:08,279 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-02-25 15:11:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:08,480 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-25 15:11:08,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:11:08,480 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-02-25 15:11:08,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:08,481 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:11:08,481 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:11:08,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:08,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:11:08,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-25 15:11:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-25 15:11:08,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-25 15:11:08,486 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-02-25 15:11:08,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:08,487 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-25 15:11:08,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:11:08,487 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-25 15:11:08,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-25 15:11:08,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:08,488 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-02-25 15:11:08,488 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:08,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:08,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-02-25 15:11:08,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:08,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:08,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:08,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:08,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:08,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:08,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:08,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:08,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:08,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:08,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:11:08,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:08,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:09,040 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-25 15:11:09,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:09,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:11:09,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:09,051 INFO L467 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-02-25 15:11:09,051 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:09,060 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:09,060 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:09,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:10,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:10,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-25 15:11:10,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:10,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:11:10,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:11:10,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:11:10,690 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-02-25 15:11:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:10,850 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:11:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:11:10,850 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-02-25 15:11:10,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:10,851 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:11:10,851 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:11:10,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-25 15:11:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:11:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-25 15:11:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:11:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:11:10,856 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-02-25 15:11:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:10,856 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:11:10,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:11:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:11:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:11:10,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:10,857 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-02-25 15:11:10,857 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:10,857 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-02-25 15:11:10,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:10,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:10,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:10,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:11,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:11,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:11,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:11,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:11,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:11,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:11,411 INFO 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-02-25 15:11:11,420 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:11,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:11,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:11,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:11,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:11:11,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:11,452 INFO L467 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-02-25 15:11:11,453 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:11,463 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:11,463 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:11,975 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:12,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:12,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-25 15:11:12,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:12,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:11:12,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:11:12,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:12,965 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-02-25 15:11:13,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:13,134 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-25 15:11:13,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:11:13,134 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-02-25 15:11:13,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:13,135 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:11:13,136 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:11:13,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:13,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:11:13,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-25 15:11:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-25 15:11:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-25 15:11:13,141 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-02-25 15:11:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:13,141 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-25 15:11:13,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:11:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-25 15:11:13,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-25 15:11:13,142 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:13,142 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-02-25 15:11:13,143 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:13,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:13,143 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-02-25 15:11:13,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:13,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:13,144 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:13,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:13,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:13,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:13,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:13,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:13,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:13,879 INFO 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-02-25 15:11:13,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:13,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:13,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:11:13,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:13,932 INFO L467 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-02-25 15:11:13,933 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:13,957 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:13,957 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:14,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:15,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:15,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-25 15:11:15,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:15,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:11:15,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:11:15,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:11:15,864 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-02-25 15:11:16,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:16,081 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-25 15:11:16,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:11:16,082 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-02-25 15:11:16,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:16,083 INFO L225 Difference]: With dead ends: 93 [2019-02-25 15:11:16,083 INFO L226 Difference]: Without dead ends: 92 [2019-02-25 15:11:16,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-25 15:11:16,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-25 15:11:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-02-25 15:11:16,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:11:16,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-25 15:11:16,088 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-02-25 15:11:16,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:16,089 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-25 15:11:16,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:11:16,089 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-25 15:11:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:11:16,089 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:16,090 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-02-25 15:11:16,090 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:16,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-02-25 15:11:16,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:16,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:16,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:16,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:16,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:16,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:16,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:16,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:16,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:16,961 INFO 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-02-25 15:11:16,970 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:16,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:17,033 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-25 15:11:17,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:17,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:11:17,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:17,049 INFO L467 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-02-25 15:11:17,050 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:17,058 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:17,059 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:17,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:17,618 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:18,756 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:18,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:18,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-25 15:11:18,776 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:18,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:11:18,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:11:18,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:18,777 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-02-25 15:11:18,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:18,967 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-25 15:11:18,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:11:18,967 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-02-25 15:11:18,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:18,968 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:11:18,968 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:11:18,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:18,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:11:18,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-25 15:11:18,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:11:18,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-25 15:11:18,972 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-02-25 15:11:18,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:18,972 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-25 15:11:18,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:11:18,973 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-25 15:11:18,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:11:18,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:18,973 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-02-25 15:11:18,973 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:18,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-02-25 15:11:18,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:18,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:18,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:18,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:19,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:19,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:19,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:19,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:19,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:19,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:19,570 INFO 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-02-25 15:11:19,579 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:19,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:19,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:19,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:19,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:11:19,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:19,621 INFO L467 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-02-25 15:11:19,621 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:19,628 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:19,629 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:20,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:20,245 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:21,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:21,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-25 15:11:21,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:11:21,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:11:21,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:11:21,461 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-02-25 15:11:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:21,758 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:11:21,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:11:21,759 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-02-25 15:11:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:21,759 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:11:21,759 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:11:21,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-25 15:11:21,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:11:21,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-25 15:11:21,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:11:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:11:21,764 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-02-25 15:11:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:21,764 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:11:21,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:11:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:11:21,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:11:21,765 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:21,765 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-02-25 15:11:21,765 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:21,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-02-25 15:11:21,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:21,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:21,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:21,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:21,767 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:22,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:22,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:22,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:22,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:22,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:22,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:22,455 INFO 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-02-25 15:11:22,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:22,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:22,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:11:22,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:22,512 INFO L467 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-02-25 15:11:22,513 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:22,530 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:22,530 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:23,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:23,269 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:24,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:24,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-25 15:11:24,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:24,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:11:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:11:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:24,564 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-02-25 15:11:24,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:24,759 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-25 15:11:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:11:24,760 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-02-25 15:11:24,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:24,761 INFO L225 Difference]: With dead ends: 102 [2019-02-25 15:11:24,761 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:11:24,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:24,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:11:24,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-25 15:11:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-25 15:11:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-25 15:11:24,766 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-02-25 15:11:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:24,766 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-25 15:11:24,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:11:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-25 15:11:24,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-25 15:11:24,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:24,767 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-02-25 15:11:24,768 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:24,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:24,768 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-02-25 15:11:24,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:24,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:24,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:24,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:25,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:25,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:25,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:25,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:25,429 INFO 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-02-25 15:11:25,437 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:25,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:25,511 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-25 15:11:25,511 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:25,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:11:25,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:25,532 INFO L467 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-02-25 15:11:25,533 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:25,605 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:25,606 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:26,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:26,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:28,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:28,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:28,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-25 15:11:28,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:28,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:11:28,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:11:28,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:11:28,144 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-02-25 15:11:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:28,392 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-25 15:11:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:11:28,393 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-02-25 15:11:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:28,394 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:11:28,394 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:11:28,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-25 15:11:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:11:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-25 15:11:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:11:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-25 15:11:28,402 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-02-25 15:11:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:28,403 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-25 15:11:28,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:11:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-25 15:11:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:11:28,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:28,404 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-02-25 15:11:28,404 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:28,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-02-25 15:11:28,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:28,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:28,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:28,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:29,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:29,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:29,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:29,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:29,128 INFO 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-02-25 15:11:29,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:29,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:29,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:29,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:29,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-25 15:11:29,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:29,177 INFO L467 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-02-25 15:11:29,177 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:29,189 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:29,189 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:30,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:30,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:31,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:31,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:31,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-25 15:11:31,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:31,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:11:31,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:11:31,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:11:31,535 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-02-25 15:11:31,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:31,828 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-25 15:11:31,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:11:31,828 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-02-25 15:11:31,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:31,829 INFO L225 Difference]: With dead ends: 108 [2019-02-25 15:11:31,829 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:11:31,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:11:31,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:11:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-25 15:11:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-25 15:11:31,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-25 15:11:31,833 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-02-25 15:11:31,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:31,834 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-25 15:11:31,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:11:31,834 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-25 15:11:31,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-25 15:11:31,834 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:31,834 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-02-25 15:11:31,834 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:31,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:31,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-02-25 15:11:31,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:31,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:31,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:31,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:32,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:32,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:32,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:32,645 INFO 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-02-25 15:11:32,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:32,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:32,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-25 15:11:32,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:32,690 INFO L467 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-02-25 15:11:32,690 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:32,700 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:32,700 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:33,467 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:35,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:35,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:35,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-25 15:11:35,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:35,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:11:35,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:11:35,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:11:35,024 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-02-25 15:11:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:35,222 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-25 15:11:35,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:11:35,223 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-02-25 15:11:35,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:35,224 INFO L225 Difference]: With dead ends: 111 [2019-02-25 15:11:35,224 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:11:35,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-25 15:11:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:11:35,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-25 15:11:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:11:35,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-25 15:11:35,229 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-02-25 15:11:35,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:35,229 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-25 15:11:35,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:11:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-25 15:11:35,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:11:35,229 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:35,229 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-02-25 15:11:35,230 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:35,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:35,230 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-02-25 15:11:35,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:35,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:35,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:35,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:35,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:35,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:35,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:35,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:35,928 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:35,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:35,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:35,928 INFO 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-02-25 15:11:35,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:35,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:36,027 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-25 15:11:36,027 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:36,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 115 conjunts are in the unsatisfiable core [2019-02-25 15:11:36,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:36,033 INFO L467 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-02-25 15:11:36,033 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:36,048 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:36,049 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:36,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:38,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:38,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:38,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-25 15:11:38,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:38,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:11:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:11:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:11:38,715 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-02-25 15:11:39,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:39,026 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-25 15:11:39,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:11:39,027 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-02-25 15:11:39,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:39,028 INFO L225 Difference]: With dead ends: 114 [2019-02-25 15:11:39,028 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:11:39,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:11:39,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:11:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-25 15:11:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:11:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-25 15:11:39,034 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-02-25 15:11:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:39,034 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-25 15:11:39,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:11:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-25 15:11:39,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-25 15:11:39,035 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:39,035 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-02-25 15:11:39,035 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:39,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:39,035 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-02-25 15:11:39,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:39,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:39,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:39,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:39,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:40,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:40,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:40,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:40,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:40,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:40,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:40,151 INFO 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-02-25 15:11:40,159 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:40,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:40,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:40,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:40,195 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 118 conjunts are in the unsatisfiable core [2019-02-25 15:11:40,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:40,200 INFO L467 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-02-25 15:11:40,201 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:40,214 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:40,215 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:41,191 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:43,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:43,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:43,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-25 15:11:43,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:43,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:11:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:11:43,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:11:43,287 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-02-25 15:11:43,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:43,510 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-25 15:11:43,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:11:43,511 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-02-25 15:11:43,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:43,512 INFO L225 Difference]: With dead ends: 117 [2019-02-25 15:11:43,512 INFO L226 Difference]: Without dead ends: 116 [2019-02-25 15:11:43,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-25 15:11:43,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-25 15:11:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-02-25 15:11:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:11:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-25 15:11:43,517 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-02-25 15:11:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:43,518 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-25 15:11:43,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:11:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-25 15:11:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:11:43,518 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:43,519 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-02-25 15:11:43,519 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-02-25 15:11:43,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:43,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:43,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:44,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:44,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:44,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:44,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:44,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:44,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:44,298 INFO 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-02-25 15:11:44,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:44,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:44,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 121 conjunts are in the unsatisfiable core [2019-02-25 15:11:44,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:44,355 INFO L467 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-02-25 15:11:44,355 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:44,364 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:44,364 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:45,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:47,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:47,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:47,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-25 15:11:47,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:47,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:11:47,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:11:47,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:11:47,275 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-02-25 15:11:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:47,622 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-25 15:11:47,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:11:47,622 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-02-25 15:11:47,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:47,624 INFO L225 Difference]: With dead ends: 120 [2019-02-25 15:11:47,624 INFO L226 Difference]: Without dead ends: 119 [2019-02-25 15:11:47,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:11:47,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-25 15:11:47,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-25 15:11:47,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-25 15:11:47,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-25 15:11:47,629 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-02-25 15:11:47,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:47,630 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-25 15:11:47,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:11:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-25 15:11:47,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-25 15:11:47,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:47,631 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-02-25 15:11:47,631 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:47,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:47,631 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-02-25 15:11:47,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:47,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:47,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:47,632 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:47,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:48,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:48,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:48,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:48,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:48,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:48,545 INFO 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-02-25 15:11:48,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:48,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:48,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-25 15:11:48,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:48,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 124 conjunts are in the unsatisfiable core [2019-02-25 15:11:48,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:48,656 INFO L467 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-02-25 15:11:48,657 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:48,669 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:48,669 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:49,909 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:51,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:51,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-25 15:11:51,903 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:51,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:11:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:11:51,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:11:51,905 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-02-25 15:11:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:52,218 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-25 15:11:52,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:11:52,218 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-02-25 15:11:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:52,220 INFO L225 Difference]: With dead ends: 123 [2019-02-25 15:11:52,220 INFO L226 Difference]: Without dead ends: 122 [2019-02-25 15:11:52,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-25 15:11:52,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-25 15:11:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-25 15:11:52,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-25 15:11:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-25 15:11:52,224 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-02-25 15:11:52,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:52,224 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-25 15:11:52,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:11:52,225 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-25 15:11:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-25 15:11:52,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:52,226 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-02-25 15:11:52,226 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:52,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-02-25 15:11:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:52,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:52,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:53,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:53,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:53,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:53,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:53,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:53,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 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-02-25 15:11:53,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:53,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:53,326 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:53,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:53,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 127 conjunts are in the unsatisfiable core [2019-02-25 15:11:53,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:53,348 INFO L467 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-02-25 15:11:53,349 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:53,431 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:53,431 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:55,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:57,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:57,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-25 15:11:57,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:57,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:11:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:11:57,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:11:57,534 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-02-25 15:11:57,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:57,859 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-25 15:11:57,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:11:57,859 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-02-25 15:11:57,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:57,860 INFO L225 Difference]: With dead ends: 126 [2019-02-25 15:11:57,860 INFO L226 Difference]: Without dead ends: 125 [2019-02-25 15:11:57,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:11:57,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-25 15:11:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-25 15:11:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-25 15:11:57,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-25 15:11:57,866 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-02-25 15:11:57,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:57,866 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-25 15:11:57,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:11:57,866 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-25 15:11:57,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-25 15:11:57,867 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:57,867 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-02-25 15:11:57,867 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:57,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:57,868 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-02-25 15:11:57,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:57,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:57,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:57,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:57,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:57,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:58,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:58,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:58,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:58,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:58,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:58,841 INFO 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-02-25 15:11:58,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:58,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:58,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 130 conjunts are in the unsatisfiable core [2019-02-25 15:11:58,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:58,890 INFO L467 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-02-25 15:11:58,890 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:11:58,899 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:11:58,899 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:11:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:59,922 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:02,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:02,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-25 15:12:02,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:12:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:12:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:12:02,053 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-02-25 15:12:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:02,410 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-02-25 15:12:02,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:12:02,411 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-02-25 15:12:02,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:02,412 INFO L225 Difference]: With dead ends: 129 [2019-02-25 15:12:02,412 INFO L226 Difference]: Without dead ends: 128 [2019-02-25 15:12:02,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-25 15:12:02,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-25 15:12:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-02-25 15:12:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-25 15:12:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-02-25 15:12:02,419 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-02-25 15:12:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:02,419 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-02-25 15:12:02,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:12:02,419 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-02-25 15:12:02,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-25 15:12:02,420 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:02,420 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-02-25 15:12:02,420 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:02,421 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-02-25 15:12:02,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:02,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:02,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:02,422 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:03,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:03,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:03,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:03,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:03,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:03,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:03,598 INFO 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-02-25 15:12:03,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:03,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:03,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-25 15:12:03,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:03,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 133 conjunts are in the unsatisfiable core [2019-02-25 15:12:03,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:03,736 INFO L467 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-02-25 15:12:03,736 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:03,746 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:03,746 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:04,824 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:07,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:07,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-25 15:12:07,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:07,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:12:07,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:12:07,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:12:07,002 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-02-25 15:12:07,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:07,340 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-25 15:12:07,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:12:07,341 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-02-25 15:12:07,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:07,342 INFO L225 Difference]: With dead ends: 132 [2019-02-25 15:12:07,342 INFO L226 Difference]: Without dead ends: 131 [2019-02-25 15:12:07,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:12:07,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-25 15:12:07,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-25 15:12:07,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-25 15:12:07,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-25 15:12:07,348 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-02-25 15:12:07,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:07,348 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-25 15:12:07,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:12:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-25 15:12:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-25 15:12:07,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:07,349 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-02-25 15:12:07,349 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:07,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-02-25 15:12:07,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:07,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:07,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:07,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:07,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:08,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:08,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:08,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:08,676 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:08,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:08,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:08,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:12:08,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:08,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:08,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:08,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:08,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 136 conjunts are in the unsatisfiable core [2019-02-25 15:12:08,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:08,745 INFO L467 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-02-25 15:12:08,745 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:08,763 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:08,764 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:09,915 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:12,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:12,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-25 15:12:12,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:12,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:12:12,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:12:12,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:12:12,219 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-02-25 15:12:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:12,734 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-25 15:12:12,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:12:12,734 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-02-25 15:12:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:12,735 INFO L225 Difference]: With dead ends: 135 [2019-02-25 15:12:12,735 INFO L226 Difference]: Without dead ends: 134 [2019-02-25 15:12:12,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-25 15:12:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-25 15:12:12,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-25 15:12:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-25 15:12:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-25 15:12:12,742 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-02-25 15:12:12,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:12,742 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-25 15:12:12,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:12:12,742 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-25 15:12:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-25 15:12:12,743 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:12,743 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-02-25 15:12:12,743 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-02-25 15:12:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:12,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:12,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:13,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:13,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:13,862 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:13,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:13,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:13,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 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-02-25 15:12:13,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:13,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:13,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 139 conjunts are in the unsatisfiable core [2019-02-25 15:12:13,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:13,915 INFO L467 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-02-25 15:12:13,915 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:13,931 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:13,931 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:15,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:17,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:17,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:17,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-25 15:12:17,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:17,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:12:17,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:12:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:12:17,549 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-02-25 15:12:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:17,815 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-25 15:12:17,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:12:17,815 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-02-25 15:12:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:17,817 INFO L225 Difference]: With dead ends: 138 [2019-02-25 15:12:17,817 INFO L226 Difference]: Without dead ends: 137 [2019-02-25 15:12:17,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:12:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-25 15:12:17,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-25 15:12:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-25 15:12:17,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-25 15:12:17,821 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-02-25 15:12:17,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:17,822 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-25 15:12:17,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:12:17,822 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-25 15:12:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-25 15:12:17,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:17,823 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-02-25 15:12:17,823 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:17,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-02-25 15:12:17,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:17,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:20,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:20,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:20,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:20,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:20,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:20,636 INFO 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-02-25 15:12:20,643 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:20,643 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:20,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-25 15:12:20,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:20,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 142 conjunts are in the unsatisfiable core [2019-02-25 15:12:20,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:20,776 INFO L467 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-02-25 15:12:20,776 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:20,787 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:20,787 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:21,982 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:24,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:24,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:24,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-25 15:12:24,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:24,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:12:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:12:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:12:24,700 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-02-25 15:12:24,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:24,964 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-02-25 15:12:24,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:12:24,966 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-02-25 15:12:24,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:24,967 INFO L225 Difference]: With dead ends: 141 [2019-02-25 15:12:24,968 INFO L226 Difference]: Without dead ends: 140 [2019-02-25 15:12:24,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-25 15:12:24,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-25 15:12:24,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-02-25 15:12:24,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-25 15:12:24,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-02-25 15:12:24,973 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-02-25 15:12:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:24,973 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-02-25 15:12:24,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:12:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-02-25 15:12:24,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-25 15:12:24,974 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:24,974 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-02-25 15:12:24,974 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:24,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-02-25 15:12:24,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:24,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:24,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:24,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:24,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:26,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:26,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:26,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:26,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:26,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:26,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:12:26,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:26,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:26,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:26,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:26,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 145 conjunts are in the unsatisfiable core [2019-02-25 15:12:26,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:26,920 INFO L467 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-02-25 15:12:26,921 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:26,937 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:26,938 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:28,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:28,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:30,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:30,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:30,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-25 15:12:30,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:30,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:12:30,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:12:30,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:12:30,822 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-02-25 15:12:31,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:31,218 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-02-25 15:12:31,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:12:31,219 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-02-25 15:12:31,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:31,220 INFO L225 Difference]: With dead ends: 144 [2019-02-25 15:12:31,220 INFO L226 Difference]: Without dead ends: 143 [2019-02-25 15:12:31,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:12:31,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-25 15:12:31,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-02-25 15:12:31,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-25 15:12:31,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-02-25 15:12:31,225 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-02-25 15:12:31,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:31,225 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-02-25 15:12:31,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:12:31,225 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-02-25 15:12:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-02-25 15:12:31,226 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:31,226 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-02-25 15:12:31,226 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:31,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:31,227 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-02-25 15:12:31,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:31,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:31,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:31,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:31,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:33,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:33,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:33,488 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:33,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:33,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:33,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:12:33,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:33,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:33,540 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 148 conjunts are in the unsatisfiable core [2019-02-25 15:12:33,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:33,544 INFO L467 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-02-25 15:12:33,544 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:33,555 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:33,555 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:34,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:34,898 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:37,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:37,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-25 15:12:37,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:37,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:12:37,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:12:37,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:12:37,851 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-02-25 15:12:38,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:38,192 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-25 15:12:38,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:12:38,193 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-02-25 15:12:38,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:38,193 INFO L225 Difference]: With dead ends: 147 [2019-02-25 15:12:38,194 INFO L226 Difference]: Without dead ends: 146 [2019-02-25 15:12:38,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-25 15:12:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-25 15:12:38,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-25 15:12:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-25 15:12:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-25 15:12:38,198 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-02-25 15:12:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:38,198 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-25 15:12:38,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:12:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-25 15:12:38,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-25 15:12:38,199 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:38,199 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-02-25 15:12:38,199 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:38,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:38,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-02-25 15:12:38,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:38,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:38,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:39,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:39,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:39,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:39,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:39,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:39,966 INFO 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-02-25 15:12:39,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:39,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:40,113 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-25 15:12:40,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:40,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 151 conjunts are in the unsatisfiable core [2019-02-25 15:12:40,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:40,138 INFO L467 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-02-25 15:12:40,139 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:40,230 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:40,230 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:41,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:41,581 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:44,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:44,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:44,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-25 15:12:44,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:44,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:12:44,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:12:44,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:12:44,600 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-02-25 15:12:44,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:44,941 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-02-25 15:12:44,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:12:44,942 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-02-25 15:12:44,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:44,943 INFO L225 Difference]: With dead ends: 150 [2019-02-25 15:12:44,943 INFO L226 Difference]: Without dead ends: 149 [2019-02-25 15:12:44,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:12:44,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-25 15:12:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-02-25 15:12:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-25 15:12:44,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-02-25 15:12:44,949 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-02-25 15:12:44,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:44,949 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-02-25 15:12:44,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:12:44,950 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-02-25 15:12:44,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-02-25 15:12:44,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:44,950 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-02-25 15:12:44,951 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:44,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:44,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-02-25 15:12:44,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:44,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:44,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:44,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:44,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:46,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:46,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:46,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:46,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:46,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:46,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:12:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:46,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:46,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:46,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:46,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 154 conjunts are in the unsatisfiable core [2019-02-25 15:12:46,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:46,215 INFO L467 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-02-25 15:12:46,216 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:46,227 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:46,227 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:47,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:47,611 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:50,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:50,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-25 15:12:50,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:50,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:12:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:12:50,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:12:50,775 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-02-25 15:12:51,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:51,222 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-02-25 15:12:51,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:12:51,222 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-02-25 15:12:51,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:51,224 INFO L225 Difference]: With dead ends: 153 [2019-02-25 15:12:51,224 INFO L226 Difference]: Without dead ends: 152 [2019-02-25 15:12:51,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-25 15:12:51,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-25 15:12:51,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-02-25 15:12:51,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-25 15:12:51,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-02-25 15:12:51,230 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-02-25 15:12:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:51,230 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-02-25 15:12:51,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:12:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-02-25 15:12:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-25 15:12:51,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:51,231 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-02-25 15:12:51,231 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-02-25 15:12:51,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:51,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:51,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:51,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:51,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:52,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:52,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:52,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:52,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:52,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:52,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:52,590 INFO 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-02-25 15:12:52,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:52,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:52,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 157 conjunts are in the unsatisfiable core [2019-02-25 15:12:52,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:52,644 INFO L467 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-02-25 15:12:52,644 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:12:52,657 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:12:52,657 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:12:54,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:54,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:57,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:57,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-25 15:12:57,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:57,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:12:57,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:12:57,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:12:57,541 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-02-25 15:12:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:57,879 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-02-25 15:12:57,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:12:57,880 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-02-25 15:12:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:57,881 INFO L225 Difference]: With dead ends: 156 [2019-02-25 15:12:57,881 INFO L226 Difference]: Without dead ends: 155 [2019-02-25 15:12:57,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:12:57,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-25 15:12:57,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-02-25 15:12:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-02-25 15:12:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-02-25 15:12:57,887 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-02-25 15:12:57,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:57,887 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-02-25 15:12:57,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:12:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-02-25 15:12:57,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-02-25 15:12:57,888 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:57,888 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-02-25 15:12:57,889 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:57,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-02-25 15:12:57,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:57,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:57,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:57,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:12:59,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:59,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:59,956 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:59,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:59,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:59,956 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:12:59,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:59,966 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:00,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-25 15:13:00,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:00,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 160 conjunts are in the unsatisfiable core [2019-02-25 15:13:00,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:00,125 INFO L467 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-02-25 15:13:00,125 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:00,146 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:00,146 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:01,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:01,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:05,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:05,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:05,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-25 15:13:05,042 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:05,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:13:05,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:13:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:13:05,044 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-02-25 15:13:05,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:05,388 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-25 15:13:05,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:13:05,388 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-02-25 15:13:05,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:05,390 INFO L225 Difference]: With dead ends: 159 [2019-02-25 15:13:05,390 INFO L226 Difference]: Without dead ends: 158 [2019-02-25 15:13:05,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-25 15:13:05,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-25 15:13:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-25 15:13:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-25 15:13:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-25 15:13:05,395 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-02-25 15:13:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:05,395 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-25 15:13:05,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:13:05,395 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-25 15:13:05,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-25 15:13:05,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:05,396 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-02-25 15:13:05,396 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:05,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:05,397 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-02-25 15:13:05,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:05,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:05,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:05,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:06,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:06,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:06,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:06,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:06,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:06,965 INFO 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-02-25 15:13:06,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:06,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:07,020 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:07,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:07,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 163 conjunts are in the unsatisfiable core [2019-02-25 15:13:07,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:07,028 INFO L467 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-02-25 15:13:07,028 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:07,036 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:07,036 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:08,831 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:12,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:12,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-25 15:13:12,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:12,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:13:12,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:13:12,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:13:12,390 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-02-25 15:13:12,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:12,754 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-02-25 15:13:12,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:13:12,754 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-02-25 15:13:12,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:12,756 INFO L225 Difference]: With dead ends: 162 [2019-02-25 15:13:12,756 INFO L226 Difference]: Without dead ends: 161 [2019-02-25 15:13:12,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:13:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-25 15:13:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-02-25 15:13:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-02-25 15:13:12,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-02-25 15:13:12,760 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-02-25 15:13:12,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:12,761 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-02-25 15:13:12,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:13:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-02-25 15:13:12,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-02-25 15:13:12,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:12,762 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-02-25 15:13:12,762 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:12,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:12,762 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-02-25 15:13:12,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:12,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:12,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:14,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:14,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:14,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:14,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:14,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:14,340 INFO 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-02-25 15:13:14,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:14,347 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:14,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:14,396 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 166 conjunts are in the unsatisfiable core [2019-02-25 15:13:14,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:14,402 INFO L467 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-02-25 15:13:14,403 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:14,412 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:14,412 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:16,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:16,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:19,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:19,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:19,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-25 15:13:19,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:19,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-25 15:13:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-25 15:13:19,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:13:19,239 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-02-25 15:13:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:19,722 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-02-25 15:13:19,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:13:19,722 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-02-25 15:13:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:19,723 INFO L225 Difference]: With dead ends: 165 [2019-02-25 15:13:19,723 INFO L226 Difference]: Without dead ends: 164 [2019-02-25 15:13:19,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-25 15:13:19,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-25 15:13:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-02-25 15:13:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-25 15:13:19,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-02-25 15:13:19,727 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-02-25 15:13:19,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:19,727 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-02-25 15:13:19,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-25 15:13:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-02-25 15:13:19,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-25 15:13:19,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:19,729 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-02-25 15:13:19,729 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:19,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-02-25 15:13:19,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:19,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:19,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:19,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:21,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:21,143 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:21,143 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:21,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:21,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:21,144 INFO 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-02-25 15:13:21,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:21,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:21,327 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-25 15:13:21,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:21,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 169 conjunts are in the unsatisfiable core [2019-02-25 15:13:21,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:21,335 INFO L467 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-02-25 15:13:21,335 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:21,343 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:21,343 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:23,547 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:27,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:27,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-25 15:13:27,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:27,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-25 15:13:27,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-25 15:13:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:13:27,165 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-02-25 15:13:27,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:27,578 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-02-25 15:13:27,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:13:27,578 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-02-25 15:13:27,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:27,579 INFO L225 Difference]: With dead ends: 168 [2019-02-25 15:13:27,580 INFO L226 Difference]: Without dead ends: 167 [2019-02-25 15:13:27,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:13:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-25 15:13:27,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-02-25 15:13:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-02-25 15:13:27,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-02-25 15:13:27,586 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-02-25 15:13:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:27,586 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-02-25 15:13:27,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-25 15:13:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-02-25 15:13:27,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-02-25 15:13:27,587 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:27,587 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-02-25 15:13:27,587 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:27,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:27,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-02-25 15:13:27,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:27,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:27,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:27,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:28,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:28,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:28,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:28,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:28,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:28,997 INFO 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-02-25 15:13:29,005 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:29,005 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:29,058 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:29,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:29,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 172 conjunts are in the unsatisfiable core [2019-02-25 15:13:29,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:29,080 INFO L467 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-02-25 15:13:29,081 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:29,169 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:29,170 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:31,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:31,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:34,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:34,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-25 15:13:34,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:34,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-25 15:13:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-25 15:13:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:13:34,442 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-02-25 15:13:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:34,871 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-25 15:13:34,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:13:34,871 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-02-25 15:13:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:34,872 INFO L225 Difference]: With dead ends: 171 [2019-02-25 15:13:34,872 INFO L226 Difference]: Without dead ends: 170 [2019-02-25 15:13:34,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-25 15:13:34,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-25 15:13:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-25 15:13:34,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-25 15:13:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-25 15:13:34,877 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-02-25 15:13:34,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:34,877 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-25 15:13:34,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-25 15:13:34,877 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-25 15:13:34,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-25 15:13:34,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:34,878 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-02-25 15:13:34,878 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:34,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:34,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-02-25 15:13:34,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:34,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:34,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:34,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:36,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:36,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:36,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:36,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:36,448 INFO 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-02-25 15:13:36,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:36,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 175 conjunts are in the unsatisfiable core [2019-02-25 15:13:36,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:36,513 INFO L467 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-02-25 15:13:36,513 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:36,523 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:36,523 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:38,401 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:42,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:42,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-25 15:13:42,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:42,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-25 15:13:42,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-25 15:13:42,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:13:42,012 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-02-25 15:13:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:42,374 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-02-25 15:13:42,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:13:42,374 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-02-25 15:13:42,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:42,375 INFO L225 Difference]: With dead ends: 174 [2019-02-25 15:13:42,375 INFO L226 Difference]: Without dead ends: 173 [2019-02-25 15:13:42,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:13:42,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-25 15:13:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-02-25 15:13:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-02-25 15:13:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-02-25 15:13:42,380 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-02-25 15:13:42,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:42,380 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-02-25 15:13:42,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-25 15:13:42,380 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-02-25 15:13:42,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-02-25 15:13:42,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:42,381 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-02-25 15:13:42,381 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:42,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:42,381 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-02-25 15:13:42,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:42,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:42,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:42,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:42,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:43,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:43,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:43,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:43,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:43,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:43,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:43,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:13:43,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:43,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:44,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-25 15:13:44,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:44,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 178 conjunts are in the unsatisfiable core [2019-02-25 15:13:44,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:44,174 INFO L467 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-02-25 15:13:44,174 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:44,186 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:44,186 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:46,142 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:49,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:49,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-25 15:13:49,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:49,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-25 15:13:49,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-25 15:13:49,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:13:49,567 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-02-25 15:13:49,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:49,957 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-02-25 15:13:49,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:13:49,957 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-02-25 15:13:49,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:49,958 INFO L225 Difference]: With dead ends: 177 [2019-02-25 15:13:49,958 INFO L226 Difference]: Without dead ends: 176 [2019-02-25 15:13:49,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-25 15:13:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-02-25 15:13:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-02-25 15:13:49,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-25 15:13:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-02-25 15:13:49,962 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-02-25 15:13:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:49,962 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-02-25 15:13:49,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-25 15:13:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-02-25 15:13:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-25 15:13:49,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:49,963 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-02-25 15:13:49,963 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:49,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:49,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-02-25 15:13:49,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:49,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:49,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:49,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:49,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:51,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:51,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:51,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:51,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:51,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:51,697 INFO 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-02-25 15:13:51,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:51,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:51,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:51,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:51,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 181 conjunts are in the unsatisfiable core [2019-02-25 15:13:51,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:51,769 INFO L467 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-02-25 15:13:51,769 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:51,781 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:51,782 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:13:53,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:53,858 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:57,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:57,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-25 15:13:57,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:57,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-25 15:13:57,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-25 15:13:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:13:57,408 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-02-25 15:13:57,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:57,825 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-02-25 15:13:57,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:13:57,825 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-02-25 15:13:57,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:57,827 INFO L225 Difference]: With dead ends: 180 [2019-02-25 15:13:57,827 INFO L226 Difference]: Without dead ends: 179 [2019-02-25 15:13:57,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:13:57,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-25 15:13:57,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-02-25 15:13:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-25 15:13:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-02-25 15:13:57,832 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-02-25 15:13:57,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:57,832 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-02-25 15:13:57,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-25 15:13:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-02-25 15:13:57,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-25 15:13:57,833 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:57,833 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-02-25 15:13:57,833 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:57,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-02-25 15:13:57,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:57,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:57,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:57,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:13:59,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:59,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:59,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:59,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:59,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:59,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 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-02-25 15:13:59,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:59,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:59,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 184 conjunts are in the unsatisfiable core [2019-02-25 15:13:59,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:59,493 INFO L467 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-02-25 15:13:59,493 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:13:59,505 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:13:59,505 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:01,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:01,751 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:05,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:05,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-25 15:14:05,158 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:05,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-25 15:14:05,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-25 15:14:05,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:14:05,160 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-02-25 15:14:05,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:05,694 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-25 15:14:05,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:14:05,695 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-02-25 15:14:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:05,696 INFO L225 Difference]: With dead ends: 183 [2019-02-25 15:14:05,696 INFO L226 Difference]: Without dead ends: 182 [2019-02-25 15:14:05,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-25 15:14:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-25 15:14:05,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-25 15:14:05,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-25 15:14:05,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-25 15:14:05,701 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-02-25 15:14:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:05,702 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-25 15:14:05,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-25 15:14:05,702 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-25 15:14:05,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-25 15:14:05,703 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:05,703 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-02-25 15:14:05,703 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:05,703 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-02-25 15:14:05,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:05,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:05,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:05,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:05,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:05,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:07,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:07,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:07,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:07,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:07,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:07,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:14:07,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:07,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:07,957 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-25 15:14:07,957 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:07,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 187 conjunts are in the unsatisfiable core [2019-02-25 15:14:07,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:07,966 INFO L467 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-02-25 15:14:07,966 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:07,978 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:07,978 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:10,063 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:10,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:14,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:14,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-25 15:14:14,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:14,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-25 15:14:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-25 15:14:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:14:14,005 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-02-25 15:14:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:14,389 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-02-25 15:14:14,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:14:14,390 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-02-25 15:14:14,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:14,391 INFO L225 Difference]: With dead ends: 186 [2019-02-25 15:14:14,391 INFO L226 Difference]: Without dead ends: 185 [2019-02-25 15:14:14,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:14:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-25 15:14:14,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-02-25 15:14:14,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-02-25 15:14:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-02-25 15:14:14,397 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-02-25 15:14:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:14,397 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-02-25 15:14:14,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-25 15:14:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-02-25 15:14:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-02-25 15:14:14,398 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:14,399 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-02-25 15:14:14,399 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:14,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:14,399 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-02-25 15:14:14,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:14,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:14,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:14,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:16,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:16,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:16,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:16,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:16,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:16,438 INFO 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-02-25 15:14:16,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:16,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:16,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:16,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:16,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 190 conjunts are in the unsatisfiable core [2019-02-25 15:14:16,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:16,526 INFO L467 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-02-25 15:14:16,526 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:16,555 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:16,555 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:18,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:22,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:22,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-25 15:14:22,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:22,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-25 15:14:22,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-25 15:14:22,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:14:22,439 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-02-25 15:14:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:22,873 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-02-25 15:14:22,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:14:22,873 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-02-25 15:14:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:22,874 INFO L225 Difference]: With dead ends: 189 [2019-02-25 15:14:22,874 INFO L226 Difference]: Without dead ends: 188 [2019-02-25 15:14:22,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-25 15:14:22,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-02-25 15:14:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-02-25 15:14:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-25 15:14:22,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-02-25 15:14:22,878 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-02-25 15:14:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:22,878 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-02-25 15:14:22,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-25 15:14:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-02-25 15:14:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-25 15:14:22,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:22,879 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-02-25 15:14:22,879 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:22,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-02-25 15:14:22,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:22,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:22,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:22,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:24,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:24,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:24,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:24,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:24,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:24,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:24,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:14:24,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:24,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:24,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 193 conjunts are in the unsatisfiable core [2019-02-25 15:14:24,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:24,796 INFO L467 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-02-25 15:14:24,796 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:24,806 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:24,806 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:27,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:27,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:30,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:30,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:30,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-25 15:14:30,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:30,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-25 15:14:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-25 15:14:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:14:30,782 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-02-25 15:14:31,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:31,341 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-02-25 15:14:31,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:14:31,342 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-02-25 15:14:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:31,343 INFO L225 Difference]: With dead ends: 192 [2019-02-25 15:14:31,343 INFO L226 Difference]: Without dead ends: 191 [2019-02-25 15:14:31,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:14:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-25 15:14:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-02-25 15:14:31,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-02-25 15:14:31,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-02-25 15:14:31,349 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-02-25 15:14:31,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:31,349 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-02-25 15:14:31,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-25 15:14:31,349 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-02-25 15:14:31,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-02-25 15:14:31,350 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:31,350 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-02-25 15:14:31,350 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:31,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-02-25 15:14:31,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:31,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:31,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:31,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:33,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:33,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:33,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:33,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:33,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:33,237 INFO 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-02-25 15:14:33,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:33,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:33,485 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-25 15:14:33,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:33,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 196 conjunts are in the unsatisfiable core [2019-02-25 15:14:33,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:33,497 INFO L467 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-02-25 15:14:33,497 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:33,506 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:33,506 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:35,732 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:39,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:39,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-25 15:14:39,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:39,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-25 15:14:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-25 15:14:39,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:14:39,573 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-02-25 15:14:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:40,067 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-25 15:14:40,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:14:40,068 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-02-25 15:14:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:40,069 INFO L225 Difference]: With dead ends: 195 [2019-02-25 15:14:40,069 INFO L226 Difference]: Without dead ends: 194 [2019-02-25 15:14:40,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-25 15:14:40,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-25 15:14:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-25 15:14:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-25 15:14:40,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-25 15:14:40,075 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-02-25 15:14:40,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:40,075 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-25 15:14:40,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-25 15:14:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-25 15:14:40,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-25 15:14:40,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:40,076 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-02-25 15:14:40,076 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:40,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:40,076 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-02-25 15:14:40,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:40,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:40,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:40,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:42,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:42,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:42,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:42,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:42,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:42,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:42,241 INFO 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-02-25 15:14:42,251 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:42,251 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:42,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:42,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:42,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 199 conjunts are in the unsatisfiable core [2019-02-25 15:14:42,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:42,321 INFO L467 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-02-25 15:14:42,321 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,330 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:42,330 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:44,822 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:44,822 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:48,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:48,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-25 15:14:48,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:48,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-25 15:14:48,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-25 15:14:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:14:48,847 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-02-25 15:14:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:49,361 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-02-25 15:14:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:14:49,361 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-02-25 15:14:49,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:49,363 INFO L225 Difference]: With dead ends: 198 [2019-02-25 15:14:49,363 INFO L226 Difference]: Without dead ends: 197 [2019-02-25 15:14:49,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:14:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-25 15:14:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-02-25 15:14:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-25 15:14:49,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-02-25 15:14:49,370 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-02-25 15:14:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:49,370 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-02-25 15:14:49,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-25 15:14:49,370 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-02-25 15:14:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-25 15:14:49,371 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:49,371 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-02-25 15:14:49,372 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:49,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:49,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-02-25 15:14:49,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:49,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:49,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:51,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:51,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:51,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:51,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:51,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:51,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:14:51,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:51,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:51,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:51,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 202 conjunts are in the unsatisfiable core [2019-02-25 15:14:51,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:51,346 INFO L467 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-02-25 15:14:51,346 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,364 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:14:51,364 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:14:53,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:53,994 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:57,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:14:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:57,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-25 15:14:57,798 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-25 15:14:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-25 15:14:57,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:14:57,800 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-02-25 15:14:58,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:58,237 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-02-25 15:14:58,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:14:58,237 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-02-25 15:14:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:58,239 INFO L225 Difference]: With dead ends: 201 [2019-02-25 15:14:58,239 INFO L226 Difference]: Without dead ends: 200 [2019-02-25 15:14:58,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-25 15:14:58,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-25 15:14:58,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-02-25 15:14:58,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-25 15:14:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-02-25 15:14:58,246 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-02-25 15:14:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:58,246 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-02-25 15:14:58,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-25 15:14:58,246 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-02-25 15:14:58,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-25 15:14:58,247 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:58,247 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-02-25 15:14:58,248 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:58,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:58,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-02-25 15:14:58,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:58,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:58,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:58,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:00,302 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:00,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:00,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:00,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:00,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:00,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:00,303 INFO 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-02-25 15:15:00,311 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:00,311 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:00,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-25 15:15:00,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:00,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 205 conjunts are in the unsatisfiable core [2019-02-25 15:15:00,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:00,583 INFO L467 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-02-25 15:15:00,583 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:00,592 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:00,592 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:03,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:03,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:07,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:07,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:07,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-25 15:15:07,513 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:07,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-25 15:15:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-25 15:15:07,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:15:07,515 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-02-25 15:15:07,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:07,956 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-02-25 15:15:07,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:15:07,956 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-02-25 15:15:07,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:07,958 INFO L225 Difference]: With dead ends: 204 [2019-02-25 15:15:07,958 INFO L226 Difference]: Without dead ends: 203 [2019-02-25 15:15:07,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:15:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-25 15:15:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-02-25 15:15:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-25 15:15:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-02-25 15:15:07,964 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-02-25 15:15:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:07,964 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-02-25 15:15:07,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-25 15:15:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-02-25 15:15:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-02-25 15:15:07,965 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:07,965 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-02-25 15:15:07,965 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:07,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-02-25 15:15:07,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:07,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:07,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:07,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:07,967 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:10,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:10,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:10,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:10,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:10,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:10,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:15:10,088 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:10,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:10,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:10,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:10,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 208 conjunts are in the unsatisfiable core [2019-02-25 15:15:10,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:10,180 INFO L467 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-02-25 15:15:10,181 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:10,191 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:10,191 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:12,942 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:12,942 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:16,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:16,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-25 15:15:16,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:16,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-25 15:15:16,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-25 15:15:16,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:15:16,648 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-02-25 15:15:17,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:17,200 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-25 15:15:17,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:15:17,201 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-02-25 15:15:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:17,202 INFO L225 Difference]: With dead ends: 207 [2019-02-25 15:15:17,202 INFO L226 Difference]: Without dead ends: 206 [2019-02-25 15:15:17,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-25 15:15:17,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-25 15:15:17,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-25 15:15:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-25 15:15:17,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-25 15:15:17,208 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-02-25 15:15:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:17,208 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-25 15:15:17,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-25 15:15:17,208 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-25 15:15:17,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-25 15:15:17,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:17,209 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-02-25 15:15:17,209 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-02-25 15:15:17,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:17,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:17,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:17,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:17,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:19,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:19,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:19,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:19,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:19,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:19,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:19,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:15:19,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:19,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:19,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 211 conjunts are in the unsatisfiable core [2019-02-25 15:15:19,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:19,473 INFO L467 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-02-25 15:15:19,474 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:19,484 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:19,484 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:22,091 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:22,091 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:26,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:26,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-25 15:15:26,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:26,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-25 15:15:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-25 15:15:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:15:26,041 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-02-25 15:15:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:26,461 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-02-25 15:15:26,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:15:26,461 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-02-25 15:15:26,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:26,462 INFO L225 Difference]: With dead ends: 210 [2019-02-25 15:15:26,462 INFO L226 Difference]: Without dead ends: 209 [2019-02-25 15:15:26,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:15:26,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-25 15:15:26,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-02-25 15:15:26,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-02-25 15:15:26,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-02-25 15:15:26,467 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-02-25 15:15:26,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:26,467 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-02-25 15:15:26,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-25 15:15:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-02-25 15:15:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-02-25 15:15:26,468 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:26,468 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-02-25 15:15:26,468 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:26,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:26,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-02-25 15:15:26,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:26,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:26,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:26,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:28,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:28,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:28,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:28,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:28,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:28,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 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-02-25 15:15:28,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:28,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:29,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-25 15:15:29,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:29,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 214 conjunts are in the unsatisfiable core [2019-02-25 15:15:29,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:29,197 INFO L467 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-02-25 15:15:29,197 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:29,209 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:29,210 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:31,868 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:35,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:35,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-25 15:15:35,923 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:35,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-25 15:15:35,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-25 15:15:35,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:15:35,926 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-02-25 15:15:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:36,485 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-02-25 15:15:36,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:15:36,485 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-02-25 15:15:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:36,487 INFO L225 Difference]: With dead ends: 213 [2019-02-25 15:15:36,487 INFO L226 Difference]: Without dead ends: 212 [2019-02-25 15:15:36,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-25 15:15:36,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-25 15:15:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-02-25 15:15:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-25 15:15:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-02-25 15:15:36,494 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-02-25 15:15:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:36,494 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-02-25 15:15:36,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-25 15:15:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-02-25 15:15:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-25 15:15:36,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:36,495 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-02-25 15:15:36,496 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:36,496 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-02-25 15:15:36,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:36,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:36,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:36,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:36,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:39,040 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:39,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:39,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:39,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:39,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:39,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:39,041 INFO 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-02-25 15:15:39,051 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:39,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:39,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:39,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:39,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 217 conjunts are in the unsatisfiable core [2019-02-25 15:15:39,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:39,128 INFO L467 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-02-25 15:15:39,129 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:39,139 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:39,139 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:41,828 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:45,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:45,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:45,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-25 15:15:45,879 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:45,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-25 15:15:45,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-25 15:15:45,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:15:45,881 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-02-25 15:15:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:46,345 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-02-25 15:15:46,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:15:46,346 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-02-25 15:15:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:46,347 INFO L225 Difference]: With dead ends: 216 [2019-02-25 15:15:46,347 INFO L226 Difference]: Without dead ends: 215 [2019-02-25 15:15:46,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:15:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-25 15:15:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-02-25 15:15:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-25 15:15:46,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-02-25 15:15:46,354 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-02-25 15:15:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:46,355 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-02-25 15:15:46,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-25 15:15:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-02-25 15:15:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-02-25 15:15:46,356 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:46,356 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-02-25 15:15:46,356 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:46,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-02-25 15:15:46,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:46,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:46,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:46,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:46,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:46,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:48,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:48,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:48,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:48,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:48,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:48,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:48,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 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-02-25 15:15:48,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:48,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:49,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 220 conjunts are in the unsatisfiable core [2019-02-25 15:15:49,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:49,012 INFO L467 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-02-25 15:15:49,012 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:49,024 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:49,024 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:15:51,841 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:51,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:56,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:56,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-25 15:15:56,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:56,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-25 15:15:56,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-25 15:15:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:15:56,034 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-02-25 15:15:56,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:56,481 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-25 15:15:56,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:15:56,482 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-02-25 15:15:56,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:56,483 INFO L225 Difference]: With dead ends: 219 [2019-02-25 15:15:56,483 INFO L226 Difference]: Without dead ends: 218 [2019-02-25 15:15:56,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-25 15:15:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-25 15:15:56,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-25 15:15:56,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-25 15:15:56,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-25 15:15:56,489 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-02-25 15:15:56,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:56,490 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-25 15:15:56,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-25 15:15:56,490 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-25 15:15:56,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-25 15:15:56,491 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:56,491 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-02-25 15:15:56,491 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:56,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:56,491 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-02-25 15:15:56,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:56,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:56,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:56,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:15:59,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:59,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:59,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:59,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:59,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:59,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:15:59,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:59,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:59,471 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-25 15:15:59,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 223 conjunts are in the unsatisfiable core [2019-02-25 15:15:59,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:59,482 INFO L467 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-02-25 15:15:59,483 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:15:59,495 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:15:59,495 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:02,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:06,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:06,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:06,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-25 15:16:06,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:06,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-25 15:16:06,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-25 15:16:06,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:16:06,433 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-02-25 15:16:06,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:06,922 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-02-25 15:16:06,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:16:06,923 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-02-25 15:16:06,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:06,924 INFO L225 Difference]: With dead ends: 222 [2019-02-25 15:16:06,924 INFO L226 Difference]: Without dead ends: 221 [2019-02-25 15:16:06,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:16:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-02-25 15:16:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-02-25 15:16:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-25 15:16:06,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-02-25 15:16:06,930 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-02-25 15:16:06,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:06,930 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-02-25 15:16:06,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-25 15:16:06,930 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-02-25 15:16:06,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-25 15:16:06,931 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:06,931 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-02-25 15:16:06,931 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:06,932 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-02-25 15:16:06,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:06,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:06,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:06,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:09,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:09,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:09,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:09,679 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:09,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:09,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:16:09,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:09,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:09,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:09,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:09,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 226 conjunts are in the unsatisfiable core [2019-02-25 15:16:09,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:09,768 INFO L467 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-02-25 15:16:09,768 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:09,776 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:09,777 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:12,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:12,728 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:16,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:16,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-25 15:16:16,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:16,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-25 15:16:16,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-25 15:16:16,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:16:16,832 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-02-25 15:16:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:17,315 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-02-25 15:16:17,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:16:17,315 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-02-25 15:16:17,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:17,317 INFO L225 Difference]: With dead ends: 225 [2019-02-25 15:16:17,317 INFO L226 Difference]: Without dead ends: 224 [2019-02-25 15:16:17,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-25 15:16:17,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-02-25 15:16:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-02-25 15:16:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-02-25 15:16:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-02-25 15:16:17,322 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-02-25 15:16:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:17,322 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-02-25 15:16:17,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-25 15:16:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-02-25 15:16:17,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-02-25 15:16:17,323 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:17,323 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-02-25 15:16:17,323 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:17,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-02-25 15:16:17,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:17,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:17,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:17,324 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:20,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:20,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:20,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:20,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:20,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:20,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:20,175 INFO 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-02-25 15:16:20,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:20,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:20,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 229 conjunts are in the unsatisfiable core [2019-02-25 15:16:20,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:20,275 INFO L467 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-02-25 15:16:20,275 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:20,287 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:20,287 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:23,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:27,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:27,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-25 15:16:27,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:27,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-25 15:16:27,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-25 15:16:27,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:16:27,442 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-02-25 15:16:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:27,968 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-02-25 15:16:27,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:16:27,969 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-02-25 15:16:27,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:27,970 INFO L225 Difference]: With dead ends: 228 [2019-02-25 15:16:27,970 INFO L226 Difference]: Without dead ends: 227 [2019-02-25 15:16:27,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:16:27,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-25 15:16:27,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-02-25 15:16:27,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-25 15:16:27,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-02-25 15:16:27,977 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-02-25 15:16:27,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:27,978 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-02-25 15:16:27,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-25 15:16:27,978 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-02-25 15:16:27,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-02-25 15:16:27,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:27,979 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-02-25 15:16:27,979 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:27,979 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-02-25 15:16:27,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:27,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:27,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:27,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:30,895 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:30,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:30,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:30,896 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:30,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:30,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:30,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:16:30,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:16:30,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:31,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-25 15:16:31,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:31,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 232 conjunts are in the unsatisfiable core [2019-02-25 15:16:31,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:31,217 INFO L467 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-02-25 15:16:31,217 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:31,226 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:31,226 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:34,613 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:38,471 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:38,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:38,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-25 15:16:38,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:38,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-25 15:16:38,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-25 15:16:38,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:16:38,492 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-02-25 15:16:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:39,117 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-25 15:16:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:16:39,118 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-02-25 15:16:39,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:39,119 INFO L225 Difference]: With dead ends: 231 [2019-02-25 15:16:39,119 INFO L226 Difference]: Without dead ends: 230 [2019-02-25 15:16:39,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-25 15:16:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-25 15:16:39,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-25 15:16:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-25 15:16:39,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-25 15:16:39,126 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-02-25 15:16:39,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:39,127 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-25 15:16:39,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-25 15:16:39,127 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-25 15:16:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-25 15:16:39,128 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:39,128 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-02-25 15:16:39,128 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-02-25 15:16:39,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:39,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:39,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:39,129 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:39,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:41,762 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:41,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:41,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:41,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:41,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:41,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:41,763 INFO 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-02-25 15:16:41,771 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:41,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:41,845 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:41,845 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:41,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 235 conjunts are in the unsatisfiable core [2019-02-25 15:16:41,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:41,856 INFO L467 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-02-25 15:16:41,856 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:41,865 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:41,865 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:45,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:49,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:49,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-25 15:16:49,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:49,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-25 15:16:49,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-25 15:16:49,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:16:49,232 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-02-25 15:16:49,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:49,938 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-02-25 15:16:49,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:16:49,938 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-02-25 15:16:49,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:49,939 INFO L225 Difference]: With dead ends: 234 [2019-02-25 15:16:49,939 INFO L226 Difference]: Without dead ends: 233 [2019-02-25 15:16:49,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:16:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-02-25 15:16:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-02-25 15:16:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-02-25 15:16:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-02-25 15:16:49,945 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-02-25 15:16:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:49,945 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-02-25 15:16:49,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-25 15:16:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-02-25 15:16:49,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-02-25 15:16:49,946 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:49,946 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-02-25 15:16:49,947 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:49,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:49,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-02-25 15:16:49,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:49,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:49,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:52,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:52,644 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:52,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:52,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:52,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:52,644 INFO 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-02-25 15:16:52,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:52,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:52,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 238 conjunts are in the unsatisfiable core [2019-02-25 15:16:52,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:52,728 INFO L467 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-02-25 15:16:52,728 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:16:52,738 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:16:52,739 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:16:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:16:56,088 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:00,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:00,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-25 15:17:00,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:00,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-25 15:17:00,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-25 15:17:00,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:17:00,428 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-02-25 15:17:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:00,965 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-02-25 15:17:00,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:17:00,966 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-02-25 15:17:00,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:00,967 INFO L225 Difference]: With dead ends: 237 [2019-02-25 15:17:00,967 INFO L226 Difference]: Without dead ends: 236 [2019-02-25 15:17:00,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-25 15:17:00,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-25 15:17:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-02-25 15:17:00,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-02-25 15:17:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-02-25 15:17:00,972 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-02-25 15:17:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:00,973 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-02-25 15:17:00,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-25 15:17:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-02-25 15:17:00,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-02-25 15:17:00,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:00,974 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-02-25 15:17:00,974 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:00,974 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-02-25 15:17:00,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:00,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:00,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:00,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:00,975 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:03,779 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:03,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:03,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:03,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:03,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:03,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:03,780 INFO 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-02-25 15:17:03,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:03,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:04,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-25 15:17:04,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:04,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 241 conjunts are in the unsatisfiable core [2019-02-25 15:17:04,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:04,173 INFO L467 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-02-25 15:17:04,174 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:04,185 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:04,185 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:07,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:07,818 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:11,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:11,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-25 15:17:11,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:11,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-25 15:17:11,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-25 15:17:11,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:17:11,970 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-02-25 15:17:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:12,584 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-02-25 15:17:12,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:17:12,584 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-02-25 15:17:12,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:12,585 INFO L225 Difference]: With dead ends: 240 [2019-02-25 15:17:12,585 INFO L226 Difference]: Without dead ends: 239 [2019-02-25 15:17:12,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:17:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-25 15:17:12,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-02-25 15:17:12,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-02-25 15:17:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-02-25 15:17:12,590 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-02-25 15:17:12,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:12,590 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-02-25 15:17:12,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-25 15:17:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-02-25 15:17:12,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-02-25 15:17:12,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:12,591 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-02-25 15:17:12,591 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:12,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-02-25 15:17:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:12,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:12,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:12,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:12,592 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:15,682 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:15,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:15,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:15,682 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:15,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:15,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:15,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 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-02-25 15:17:15,690 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:15,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:15,765 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:15,766 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:15,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 244 conjunts are in the unsatisfiable core [2019-02-25 15:17:15,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:15,775 INFO L467 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-02-25 15:17:15,775 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:15,786 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:15,786 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:19,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:19,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:23,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:23,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-25 15:17:23,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:23,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-25 15:17:23,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-25 15:17:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:17:23,372 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-02-25 15:17:23,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:23,943 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-25 15:17:23,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:17:23,943 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-02-25 15:17:23,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:23,945 INFO L225 Difference]: With dead ends: 243 [2019-02-25 15:17:23,945 INFO L226 Difference]: Without dead ends: 242 [2019-02-25 15:17:23,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-25 15:17:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-25 15:17:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-25 15:17:23,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-25 15:17:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-25 15:17:23,951 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-02-25 15:17:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:23,951 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-25 15:17:23,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-25 15:17:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-25 15:17:23,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-25 15:17:23,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:23,953 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-02-25 15:17:23,953 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:23,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-02-25 15:17:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:23,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:23,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:23,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:27,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:27,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:27,232 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:27,232 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:27,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:27,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:27,232 INFO 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-02-25 15:17:27,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:27,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:17:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:27,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 247 conjunts are in the unsatisfiable core [2019-02-25 15:17:27,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:27,314 INFO L467 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-02-25 15:17:27,314 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:27,323 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:27,323 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:31,127 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:35,131 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:35,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:35,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-25 15:17:35,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:35,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-25 15:17:35,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-25 15:17:35,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:17:35,151 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-02-25 15:17:35,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:35,790 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-02-25 15:17:35,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:17:35,790 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-02-25 15:17:35,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:35,791 INFO L225 Difference]: With dead ends: 246 [2019-02-25 15:17:35,791 INFO L226 Difference]: Without dead ends: 245 [2019-02-25 15:17:35,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:17:35,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-25 15:17:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-02-25 15:17:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-02-25 15:17:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-02-25 15:17:35,797 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-02-25 15:17:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:35,798 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-02-25 15:17:35,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-25 15:17:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-02-25 15:17:35,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-02-25 15:17:35,798 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:35,799 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-02-25 15:17:35,799 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:35,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-02-25 15:17:35,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:35,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:35,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:35,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:38,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:38,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:38,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:38,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:38,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:38,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:38,841 INFO 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-02-25 15:17:38,851 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:38,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:39,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-25 15:17:39,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:39,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 250 conjunts are in the unsatisfiable core [2019-02-25 15:17:39,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:39,258 INFO L467 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-02-25 15:17:39,258 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:39,269 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:39,269 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:43,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:47,389 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-25 15:17:47,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:47,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-25 15:17:47,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-25 15:17:47,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:17:47,411 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-02-25 15:17:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:47,960 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-02-25 15:17:47,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:17:47,961 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-02-25 15:17:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:47,962 INFO L225 Difference]: With dead ends: 249 [2019-02-25 15:17:47,962 INFO L226 Difference]: Without dead ends: 248 [2019-02-25 15:17:47,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-25 15:17:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-25 15:17:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-02-25 15:17:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-25 15:17:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-02-25 15:17:47,967 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-02-25 15:17:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:47,968 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-02-25 15:17:47,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-25 15:17:47,968 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-02-25 15:17:47,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-02-25 15:17:47,968 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:47,969 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-02-25 15:17:47,969 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:47,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:47,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-02-25 15:17:47,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:47,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:47,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:47,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:51,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:51,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:51,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:51,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:51,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:51,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:51,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:17:51,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:51,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:51,365 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:51,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:51,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 253 conjunts are in the unsatisfiable core [2019-02-25 15:17:51,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:51,378 INFO L467 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-02-25 15:17:51,378 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:17:51,386 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:17:51,386 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:17:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:55,054 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:17:59,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:59,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-25 15:17:59,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:59,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-25 15:17:59,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-25 15:17:59,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:17:59,328 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-02-25 15:17:59,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:59,908 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-02-25 15:17:59,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:17:59,908 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-02-25 15:17:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:59,909 INFO L225 Difference]: With dead ends: 252 [2019-02-25 15:17:59,909 INFO L226 Difference]: Without dead ends: 251 [2019-02-25 15:17:59,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:17:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-02-25 15:17:59,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-02-25 15:17:59,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-25 15:17:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-02-25 15:17:59,914 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-02-25 15:17:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:59,915 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-02-25 15:17:59,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-25 15:17:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-02-25 15:17:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-02-25 15:17:59,915 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:59,916 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-02-25 15:17:59,916 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-02-25 15:17:59,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:59,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:59,917 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:59,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:59,917 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:03,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:03,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:03,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:03,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:03,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:03,137 INFO 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-02-25 15:18:03,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:03,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:03,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:03,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 256 conjunts are in the unsatisfiable core [2019-02-25 15:18:03,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:03,222 INFO L467 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-02-25 15:18:03,222 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:03,238 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:03,238 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:07,219 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:07,220 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:11,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:11,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-25 15:18:11,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:11,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-25 15:18:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-25 15:18:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:18:11,363 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-02-25 15:18:11,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:11,950 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-25 15:18:11,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:18:11,951 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-02-25 15:18:11,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:11,952 INFO L225 Difference]: With dead ends: 255 [2019-02-25 15:18:11,953 INFO L226 Difference]: Without dead ends: 254 [2019-02-25 15:18:11,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-25 15:18:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-25 15:18:11,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-25 15:18:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-25 15:18:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-25 15:18:11,959 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-02-25 15:18:11,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:11,959 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-25 15:18:11,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-25 15:18:11,959 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-25 15:18:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-25 15:18:11,960 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:11,960 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-02-25 15:18:11,961 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-02-25 15:18:11,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:11,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:11,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:11,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:11,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:15,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:15,187 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:15,187 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:15,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:15,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:15,188 INFO 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-02-25 15:18:15,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:15,196 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:15,628 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-25 15:18:15,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:15,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 259 conjunts are in the unsatisfiable core [2019-02-25 15:18:15,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:15,640 INFO L467 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-02-25 15:18:15,640 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:15,648 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:15,649 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:19,774 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:23,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:23,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-25 15:18:23,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:23,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-25 15:18:23,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-25 15:18:23,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:18:23,908 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-02-25 15:18:24,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:24,523 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-02-25 15:18:24,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:18:24,524 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-02-25 15:18:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:24,526 INFO L225 Difference]: With dead ends: 258 [2019-02-25 15:18:24,526 INFO L226 Difference]: Without dead ends: 257 [2019-02-25 15:18:24,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:18:24,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-02-25 15:18:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-02-25 15:18:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-02-25 15:18:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-02-25 15:18:24,547 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-02-25 15:18:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:24,547 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-02-25 15:18:24,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-25 15:18:24,548 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-02-25 15:18:24,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-02-25 15:18:24,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:24,548 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-02-25 15:18:24,549 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:24,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:24,549 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-02-25 15:18:24,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:24,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:24,550 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:24,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:24,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:27,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:27,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:27,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:27,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:27,801 INFO 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-02-25 15:18:27,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:18:27,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:18:27,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:18:27,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:27,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 262 conjunts are in the unsatisfiable core [2019-02-25 15:18:27,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:27,903 INFO L467 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-02-25 15:18:27,903 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:27,913 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:27,913 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:31,913 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:35,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:36,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:36,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-25 15:18:36,008 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:36,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-25 15:18:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-25 15:18:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:18:36,010 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-02-25 15:18:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:36,672 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-02-25 15:18:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:18:36,672 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-02-25 15:18:36,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:36,674 INFO L225 Difference]: With dead ends: 261 [2019-02-25 15:18:36,674 INFO L226 Difference]: Without dead ends: 260 [2019-02-25 15:18:36,675 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-25 15:18:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-02-25 15:18:36,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-02-25 15:18:36,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-25 15:18:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-02-25 15:18:36,681 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-02-25 15:18:36,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:36,682 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-02-25 15:18:36,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-25 15:18:36,682 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-02-25 15:18:36,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-25 15:18:36,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:36,683 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-02-25 15:18:36,683 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:36,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:36,683 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-02-25 15:18:36,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:36,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:36,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:36,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:40,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:40,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:40,270 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:40,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:40,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:40,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-25 15:18:40,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:40,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:40,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:40,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 265 conjunts are in the unsatisfiable core [2019-02-25 15:18:40,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:40,362 INFO L467 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-02-25 15:18:40,362 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:40,374 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:40,374 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:44,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:44,601 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:48,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:48,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-25 15:18:48,939 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:48,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-25 15:18:48,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-25 15:18:48,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:18:48,941 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-02-25 15:18:49,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:49,627 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-02-25 15:18:49,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:18:49,627 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-02-25 15:18:49,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:49,628 INFO L225 Difference]: With dead ends: 264 [2019-02-25 15:18:49,629 INFO L226 Difference]: Without dead ends: 263 [2019-02-25 15:18:49,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:18:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-02-25 15:18:49,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-02-25 15:18:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-25 15:18:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-02-25 15:18:49,634 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-02-25 15:18:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:49,634 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-02-25 15:18:49,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-25 15:18:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-02-25 15:18:49,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-25 15:18:49,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:49,635 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-02-25 15:18:49,636 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:49,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:49,636 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-02-25 15:18:49,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:49,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:49,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:53,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:53,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:53,406 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:53,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:53,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:53,406 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:53,414 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:53,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:53,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-25 15:18:53,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:53,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 538 conjuncts, 268 conjunts are in the unsatisfiable core [2019-02-25 15:18:53,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:53,890 INFO L467 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-02-25 15:18:53,890 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:18:53,906 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:18:53,907 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:18:58,251 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:58,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:02,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:02,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-25 15:19:02,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:02,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-25 15:19:02,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-25 15:19:02,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:19:02,465 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-02-25 15:19:03,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:03,169 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-25 15:19:03,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:19:03,169 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-02-25 15:19:03,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:03,170 INFO L225 Difference]: With dead ends: 267 [2019-02-25 15:19:03,170 INFO L226 Difference]: Without dead ends: 266 [2019-02-25 15:19:03,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-25 15:19:03,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-25 15:19:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-25 15:19:03,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-25 15:19:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-25 15:19:03,175 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-02-25 15:19:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:03,175 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-25 15:19:03,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-25 15:19:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-25 15:19:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-25 15:19:03,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:03,177 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-02-25 15:19:03,177 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:03,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:03,177 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-02-25 15:19:03,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:03,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:03,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:03,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:03,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:06,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:06,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:06,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:06,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:06,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:06,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:06,589 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:06,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:06,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:06,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:06,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 271 conjunts are in the unsatisfiable core [2019-02-25 15:19:06,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:06,689 INFO L467 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-02-25 15:19:06,689 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:06,697 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:06,698 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:11,158 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:15,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:15,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-25 15:19:15,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:15,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-25 15:19:15,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-25 15:19:15,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:19:15,561 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-02-25 15:19:16,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:16,177 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-02-25 15:19:16,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:19:16,177 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-02-25 15:19:16,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:16,179 INFO L225 Difference]: With dead ends: 270 [2019-02-25 15:19:16,179 INFO L226 Difference]: Without dead ends: 269 [2019-02-25 15:19:16,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:19:16,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-25 15:19:16,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-02-25 15:19:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-02-25 15:19:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-02-25 15:19:16,186 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-02-25 15:19:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:16,187 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-02-25 15:19:16,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-25 15:19:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-02-25 15:19:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-02-25 15:19:16,188 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:16,188 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-02-25 15:19:16,188 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:16,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-02-25 15:19:16,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:16,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:16,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:16,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:19,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:19,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:19,979 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:19,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:19,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:19,979 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:19,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:19,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:19:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:20,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 274 conjunts are in the unsatisfiable core [2019-02-25 15:19:20,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:20,075 INFO L467 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-02-25 15:19:20,075 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:20,085 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:20,085 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:24,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:28,996 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:29,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:29,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-25 15:19:29,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:29,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-25 15:19:29,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-25 15:19:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:19:29,018 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-02-25 15:19:29,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:29,772 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-02-25 15:19:29,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:19:29,773 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-02-25 15:19:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:29,774 INFO L225 Difference]: With dead ends: 273 [2019-02-25 15:19:29,774 INFO L226 Difference]: Without dead ends: 272 [2019-02-25 15:19:29,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-25 15:19:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-25 15:19:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-02-25 15:19:29,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-25 15:19:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-02-25 15:19:29,779 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-02-25 15:19:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:29,779 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-02-25 15:19:29,779 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-25 15:19:29,779 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-02-25 15:19:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-02-25 15:19:29,780 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:29,780 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-02-25 15:19:29,780 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-02-25 15:19:29,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:29,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:29,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:29,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:33,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:33,670 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:33,670 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:33,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:33,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:33,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:33,679 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:33,679 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:34,186 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-25 15:19:34,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:34,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 277 conjunts are in the unsatisfiable core [2019-02-25 15:19:34,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:34,198 INFO L467 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-02-25 15:19:34,198 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:34,207 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:34,207 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:38,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:38,891 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:43,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:43,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-25 15:19:43,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:43,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-25 15:19:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-25 15:19:43,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:19:43,103 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-02-25 15:19:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:43,915 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-02-25 15:19:43,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:19:43,916 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-02-25 15:19:43,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:43,917 INFO L225 Difference]: With dead ends: 276 [2019-02-25 15:19:43,918 INFO L226 Difference]: Without dead ends: 275 [2019-02-25 15:19:43,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:19:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-25 15:19:43,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-02-25 15:19:43,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-25 15:19:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-02-25 15:19:43,923 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-02-25 15:19:43,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:43,923 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-02-25 15:19:43,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-25 15:19:43,923 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-02-25 15:19:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-02-25 15:19:43,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:43,924 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-02-25 15:19:43,924 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:43,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-02-25 15:19:43,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:43,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:43,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:43,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:47,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:47,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:47,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:47,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:47,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:47,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:47,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:47,639 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:47,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:47,725 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:47,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:47,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 280 conjunts are in the unsatisfiable core [2019-02-25 15:19:47,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:47,737 INFO L467 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-02-25 15:19:47,737 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:19:47,747 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:19:47,747 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:19:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:52,380 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:56,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:56,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-25 15:19:56,815 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:56,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-25 15:19:56,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-25 15:19:56,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:19:56,818 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-02-25 15:19:57,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:57,514 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-25 15:19:57,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:19:57,514 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-02-25 15:19:57,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:57,516 INFO L225 Difference]: With dead ends: 279 [2019-02-25 15:19:57,516 INFO L226 Difference]: Without dead ends: 278 [2019-02-25 15:19:57,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-25 15:19:57,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-25 15:19:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-25 15:19:57,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-25 15:19:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-25 15:19:57,521 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-02-25 15:19:57,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:57,522 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-25 15:19:57,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-25 15:19:57,522 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-25 15:19:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-25 15:19:57,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:57,523 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-02-25 15:19:57,523 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:57,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:57,523 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-02-25 15:19:57,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:57,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:57,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:57,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:01,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:01,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:01,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:01,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:01,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:01,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:01,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:01,365 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:01,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 568 conjuncts, 283 conjunts are in the unsatisfiable core [2019-02-25 15:20:01,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:01,455 INFO L467 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-02-25 15:20:01,455 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:01,462 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:01,463 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:06,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:06,786 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:11,205 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:11,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:11,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-25 15:20:11,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:11,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-25 15:20:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-25 15:20:11,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:20:11,227 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-02-25 15:20:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:11,913 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-02-25 15:20:11,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:20:11,913 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-02-25 15:20:11,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:11,915 INFO L225 Difference]: With dead ends: 282 [2019-02-25 15:20:11,915 INFO L226 Difference]: Without dead ends: 281 [2019-02-25 15:20:11,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:20:11,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-25 15:20:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-02-25 15:20:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-02-25 15:20:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-02-25 15:20:11,921 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-02-25 15:20:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:11,921 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-02-25 15:20:11,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-25 15:20:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-02-25 15:20:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-02-25 15:20:11,922 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:11,922 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-02-25 15:20:11,922 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:11,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:11,922 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-02-25 15:20:11,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:11,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:11,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:11,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:11,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:15,987 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:15,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:15,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:15,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:15,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:15,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:15,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:15,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:15,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:16,539 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-25 15:20:16,540 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:16,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 286 conjunts are in the unsatisfiable core [2019-02-25 15:20:16,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:16,552 INFO L467 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-02-25 15:20:16,552 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:16,563 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:16,563 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:21,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:25,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:25,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-25 15:20:25,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:25,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-25 15:20:25,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-25 15:20:25,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:20:25,947 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-02-25 15:20:26,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:26,697 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-02-25 15:20:26,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:20:26,697 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-02-25 15:20:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:26,698 INFO L225 Difference]: With dead ends: 285 [2019-02-25 15:20:26,698 INFO L226 Difference]: Without dead ends: 284 [2019-02-25 15:20:26,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-25 15:20:26,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-25 15:20:26,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-02-25 15:20:26,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-25 15:20:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-02-25 15:20:26,704 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-02-25 15:20:26,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:26,705 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-02-25 15:20:26,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-25 15:20:26,705 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-02-25 15:20:26,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-02-25 15:20:26,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:26,706 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-02-25 15:20:26,706 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:26,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:26,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-02-25 15:20:26,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:26,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:26,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:26,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:30,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:30,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:30,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:30,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:30,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:30,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:30,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:30,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:31,008 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:31,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:31,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 289 conjunts are in the unsatisfiable core [2019-02-25 15:20:31,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:31,028 INFO L467 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-02-25 15:20:31,028 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,040 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:31,040 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:36,033 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:40,446 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:40,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:40,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-25 15:20:40,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:40,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-25 15:20:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-25 15:20:40,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:20:40,468 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2019-02-25 15:20:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:41,237 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-02-25 15:20:41,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:20:41,238 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2019-02-25 15:20:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:41,239 INFO L225 Difference]: With dead ends: 288 [2019-02-25 15:20:41,240 INFO L226 Difference]: Without dead ends: 287 [2019-02-25 15:20:41,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:20:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-25 15:20:41,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-02-25 15:20:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-02-25 15:20:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-02-25 15:20:41,245 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-02-25 15:20:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:41,246 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-02-25 15:20:41,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-25 15:20:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-02-25 15:20:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-02-25 15:20:41,246 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:41,247 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2019-02-25 15:20:41,247 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:41,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2019-02-25 15:20:41,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:41,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:41,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:41,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:45,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:45,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:45,606 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:45,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:45,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:45,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:45,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:45,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:45,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 292 conjunts are in the unsatisfiable core [2019-02-25 15:20:45,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:45,703 INFO L467 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-02-25 15:20:45,703 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,714 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:20:45,714 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:20:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:50,769 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:55,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:55,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-25 15:20:55,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:55,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-25 15:20:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-25 15:20:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 15:20:55,035 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2019-02-25 15:20:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:55,791 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-25 15:20:55,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:20:55,791 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2019-02-25 15:20:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:55,793 INFO L225 Difference]: With dead ends: 291 [2019-02-25 15:20:55,793 INFO L226 Difference]: Without dead ends: 290 [2019-02-25 15:20:55,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-25 15:20:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-25 15:20:55,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-25 15:20:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-25 15:20:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-25 15:20:55,799 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-02-25 15:20:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:55,799 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-25 15:20:55,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-25 15:20:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-25 15:20:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-25 15:20:55,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:55,800 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2019-02-25 15:20:55,801 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2019-02-25 15:20:55,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:55,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:55,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:55,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:59,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:59,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:59,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:59,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:59,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:59,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:59,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:59,874 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:00,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-25 15:21:00,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:00,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 295 conjunts are in the unsatisfiable core [2019-02-25 15:21:00,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:00,472 INFO L467 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-02-25 15:21:00,472 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,480 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:00,480 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:05,311 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:05,312 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:09,693 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:09,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:09,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-25 15:21:09,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:09,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-25 15:21:09,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-25 15:21:09,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:21:09,715 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2019-02-25 15:21:10,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:10,579 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-02-25 15:21:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:21:10,579 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2019-02-25 15:21:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:10,580 INFO L225 Difference]: With dead ends: 294 [2019-02-25 15:21:10,580 INFO L226 Difference]: Without dead ends: 293 [2019-02-25 15:21:10,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:21:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-02-25 15:21:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-02-25 15:21:10,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-02-25 15:21:10,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-02-25 15:21:10,586 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-02-25 15:21:10,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:10,587 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-02-25 15:21:10,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-25 15:21:10,587 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-02-25 15:21:10,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-02-25 15:21:10,588 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:10,588 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2019-02-25 15:21:10,588 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:10,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:10,588 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2019-02-25 15:21:10,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:10,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:10,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:10,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:14,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:14,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:14,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:14,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:14,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:14,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:14,792 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:21:14,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:21:14,890 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:21:14,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:14,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 298 conjunts are in the unsatisfiable core [2019-02-25 15:21:14,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:14,902 INFO L467 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-02-25 15:21:14,902 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:14,912 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:14,912 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:20,142 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:20,143 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:24,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:24,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-25 15:21:24,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:24,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-25 15:21:24,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-25 15:21:24,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 15:21:24,478 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2019-02-25 15:21:25,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:25,200 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-02-25 15:21:25,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:21:25,200 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2019-02-25 15:21:25,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:25,202 INFO L225 Difference]: With dead ends: 297 [2019-02-25 15:21:25,202 INFO L226 Difference]: Without dead ends: 296 [2019-02-25 15:21:25,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-25 15:21:25,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-02-25 15:21:25,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-02-25 15:21:25,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-02-25 15:21:25,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-02-25 15:21:25,208 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-02-25 15:21:25,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:25,208 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-02-25 15:21:25,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-25 15:21:25,208 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-02-25 15:21:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-02-25 15:21:25,209 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:25,209 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2019-02-25 15:21:25,210 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2019-02-25 15:21:25,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:25,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:25,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:25,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:29,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:29,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:29,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:29,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:29,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:29,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:29,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:29,771 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:29,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 301 conjunts are in the unsatisfiable core [2019-02-25 15:21:29,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:29,865 INFO L467 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-02-25 15:21:29,865 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:29,875 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:29,875 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:35,180 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:39,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:39,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-25 15:21:39,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:39,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-25 15:21:39,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-25 15:21:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:21:39,671 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2019-02-25 15:21:40,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:40,453 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-02-25 15:21:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 15:21:40,454 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2019-02-25 15:21:40,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:40,455 INFO L225 Difference]: With dead ends: 300 [2019-02-25 15:21:40,456 INFO L226 Difference]: Without dead ends: 299 [2019-02-25 15:21:40,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:21:40,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-02-25 15:21:40,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-02-25 15:21:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-02-25 15:21:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-02-25 15:21:40,462 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-02-25 15:21:40,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:40,462 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-02-25 15:21:40,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-25 15:21:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-02-25 15:21:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-02-25 15:21:40,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:40,464 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2019-02-25 15:21:40,464 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2019-02-25 15:21:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:40,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:40,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:45,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:45,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:45,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:45,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:45,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:45,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:45,176 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:45,184 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:21:45,185 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:45,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-25 15:21:45,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:45,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 304 conjunts are in the unsatisfiable core [2019-02-25 15:21:45,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:45,819 INFO L467 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-02-25 15:21:45,819 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:21:45,830 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:21:45,830 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:21:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:51,549 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:55,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:55,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-25 15:21:55,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:55,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-25 15:21:55,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-25 15:21:55,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 15:21:55,828 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2019-02-25 15:21:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:56,825 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-25 15:21:56,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 15:21:56,826 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2019-02-25 15:21:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:56,827 INFO L225 Difference]: With dead ends: 303 [2019-02-25 15:21:56,827 INFO L226 Difference]: Without dead ends: 302 [2019-02-25 15:21:56,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-25 15:21:56,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-25 15:21:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-25 15:21:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-25 15:21:56,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-25 15:21:56,833 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-02-25 15:21:56,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:56,833 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-25 15:21:56,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-25 15:21:56,833 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-25 15:21:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-25 15:21:56,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:56,835 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2019-02-25 15:21:56,835 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2019-02-25 15:21:56,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:56,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:56,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:56,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:01,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:01,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:01,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:01,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:01,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:01,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:01,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:01,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:22:01,449 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:22:01,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:22:01,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:01,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 307 conjunts are in the unsatisfiable core [2019-02-25 15:22:01,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:01,600 INFO L467 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-02-25 15:22:01,600 INFO L301 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-25 15:22:01,618 INFO L301 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-25 15:22:01,618 INFO L208 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-25 15:22:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:07,448 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:11,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:11,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-25 15:22:11,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:11,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-25 15:22:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-25 15:22:11,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:22:11,584 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2019-02-25 15:22:12,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:12,425 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-25 15:22:12,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:22:12,426 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2019-02-25 15:22:12,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:12,427 INFO L225 Difference]: With dead ends: 306 [2019-02-25 15:22:12,428 INFO L226 Difference]: Without dead ends: 305 [2019-02-25 15:22:12,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:22:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-02-25 15:22:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-02-25 15:22:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-25 15:22:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-02-25 15:22:12,434 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-02-25 15:22:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:12,434 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-02-25 15:22:12,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-25 15:22:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-02-25 15:22:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-02-25 15:22:12,436 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:12,436 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2019-02-25 15:22:12,436 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2019-02-25 15:22:12,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:12,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:12,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:12,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:12,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:12,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:16,810 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:16,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:16,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:16,810 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:16,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:16,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:16,811 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:16,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:16,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:16,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-25 15:22:16,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:17,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:17,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:21,275 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-25 15:22:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2019-02-25 15:22:21,275 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:22:21,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-25 15:22:21,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-25 15:22:21,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:22:21,277 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2019-02-25 15:22:22,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:22,024 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-25 15:22:22,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:22:22,024 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2019-02-25 15:22:22,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:22,025 INFO L225 Difference]: With dead ends: 306 [2019-02-25 15:22:22,025 INFO L226 Difference]: Without dead ends: 0 [2019-02-25 15:22:22,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:22:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-25 15:22:22,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-25 15:22:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-25 15:22:22,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-25 15:22:22,029 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-02-25 15:22:22,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:22,029 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-25 15:22:22,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-25 15:22:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-25 15:22:22,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-25 15:22:22,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-25 15:22:22,157 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-02-25 15:22:25,360 WARN L181 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-25 15:22:25,367 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2019-02-25 15:22:25,367 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2019-02-25 15:22:25,367 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2019-02-25 15:22:25,367 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-02-25 15:22:25,367 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-02-25 15:22:25,370 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-02-25 15:22:25,370 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2019-02-25 15:22:25,424 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.02 03:22:25 BoogieIcfgContainer [2019-02-25 15:22:25,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-25 15:22:25,425 INFO L168 Benchmark]: Toolchain (without parser) took 711186.94 ms. Allocated memory was 132.6 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.8 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-02-25 15:22:25,425 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-25 15:22:25,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.80 ms. Allocated memory is still 132.6 MB. Free memory was 106.5 MB in the beginning and 104.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:25,426 INFO L168 Benchmark]: Boogie Preprocessor took 26.61 ms. Allocated memory is still 132.6 MB. Free memory was 104.2 MB in the beginning and 103.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:25,426 INFO L168 Benchmark]: RCFGBuilder took 257.66 ms. Allocated memory is still 132.6 MB. Free memory was 103.1 MB in the beginning and 93.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2019-02-25 15:22:25,427 INFO L168 Benchmark]: TraceAbstraction took 710838.79 ms. Allocated memory was 132.6 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 93.4 MB in the beginning and 2.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-02-25 15:22:25,429 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 132.6 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.80 ms. Allocated memory is still 132.6 MB. Free memory was 106.5 MB in the beginning and 104.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 26.61 ms. Allocated memory is still 132.6 MB. Free memory was 104.2 MB in the beginning and 103.1 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 257.66 ms. Allocated memory is still 132.6 MB. Free memory was 103.1 MB in the beginning and 93.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 710838.79 ms. Allocated memory was 132.6 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 93.4 MB in the beginning and 2.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 710.7s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 41.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 622.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 12.3s SatisfiabilityAnalysisTime, 644.9s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...