java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:11,298 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:11,300 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:11,312 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:11,313 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:11,314 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:11,315 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:11,317 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:11,319 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:11,320 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:11,321 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:11,321 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:11,322 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:11,323 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:11,324 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:11,325 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:11,326 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:11,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:11,331 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:11,333 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:11,334 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:11,335 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:11,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:11,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:11,338 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:11,339 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:11,340 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:11,341 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:11,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:11,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:11,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:11,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:11,344 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:11,344 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:11,345 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:11,346 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:11,347 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-28 10:10:11,360 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:11,360 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:11,361 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:11,361 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:11,362 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:11,362 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:11,362 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:11,363 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:11,363 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:11,363 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:11,363 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:11,363 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:11,363 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:11,364 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:11,365 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:11,365 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:11,365 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:11,365 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:11,365 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:11,366 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:11,366 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:11,366 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:11,366 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:11,366 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:11,366 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:11,367 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:11,368 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:11,368 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:11,369 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:11,369 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:11,369 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:11,369 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,369 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:11,370 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:11,370 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:11,370 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:11,370 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:11,370 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:11,371 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:11,371 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:11,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:11,433 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:11,438 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:11,439 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:11,440 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:11,441 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-02-28 10:10:11,441 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-02-28 10:10:11,486 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:11,488 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:11,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:11,489 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:11,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,525 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,526 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:11,527 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:11,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,539 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,540 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,545 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,546 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,547 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:11,548 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:11,548 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:11,549 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:11,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:11,863 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:11,863 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 10:10:11,865 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11 BoogieIcfgContainer [2019-02-28 10:10:11,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:11,868 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:11,868 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:11,872 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:11,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/2) ... [2019-02-28 10:10:11,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a96a455 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:11, skipping insertion in model container [2019-02-28 10:10:11,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11" (2/2) ... [2019-02-28 10:10:11,876 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-02-28 10:10:11,887 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:11,895 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:11,914 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:11,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:11,955 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:11,955 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:11,955 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:11,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:11,956 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:11,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:11,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 10:10:11,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:10:11,985 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:11,986 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:10:11,993 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-28 10:10:12,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,144 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-28 10:10:12,146 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:12,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:10:12,147 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:12,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:12,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:12,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,164 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 10:10:12,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,207 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 10:10:12,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:12,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:10:12,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,234 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:10:12,234 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 10:10:12,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 10:10:12,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 10:10:12,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 10:10:12,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 10:10:12,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 10:10:12,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,276 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 10:10:12,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 10:10:12,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:10:12,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:10:12,278 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-28 10:10:12,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:12,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:12,442 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:10:12,444 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-28 10:10:12,498 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:12,499 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:12,601 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:12,603 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-28 10:10:12,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:12,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:12,610 INFO 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-28 10:10:12,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:10:12,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,679 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-28 10:10:13,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:13,010 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-28 10:10:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,065 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 10:10:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:13,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:10:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,079 INFO L225 Difference]: With dead ends: 8 [2019-02-28 10:10:13,079 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 10:10:13,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:13,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 10:10:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 10:10:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:10:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 10:10:13,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-28 10:10:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,084 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 10:10:13,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 10:10:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:10:13,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,084 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:10:13,085 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,085 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-28 10:10:13,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,087 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:13,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:13,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,162 INFO 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-28 10:10:13,174 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:13,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:13,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:10:13,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:13,188 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,194 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-28 10:10:13,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:10:13,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:10:13,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:13,288 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-28 10:10:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,324 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 10:10:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:13,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:10:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,325 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:10:13,325 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:10:13,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:13,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:10:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:10:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:10:13,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 10:10:13,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-28 10:10:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,329 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 10:10:13,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:10:13,329 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 10:10:13,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:13,330 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,330 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-28 10:10:13,330 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,331 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-28 10:10:13,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:13,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:13,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:13,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:13,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:13,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:13,496 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:13,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:13,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,506 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,866 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:10:13,885 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:10:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:10:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:13,886 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-28 10:10:13,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,910 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 10:10:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:10:13,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-28 10:10:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,912 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:10:13,912 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:10:13,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:10:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:10:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:10:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:10:13,915 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-28 10:10:13,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,915 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:10:13,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:10:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:10:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:10:13,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,916 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-28 10:10:13,917 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-28 10:10:13,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,107 INFO 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-28 10:10:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,116 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,154 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,254 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-28 10:10:14,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:10:14,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:10:14,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:10:14,275 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-28 10:10:14,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,302 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 10:10:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:14,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:10:14,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,305 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:10:14,305 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:10:14,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:10:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:10:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:10:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:10:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-28 10:10:14,308 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-28 10:10:14,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,308 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-28 10:10:14,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:10:14,309 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 10:10:14,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:10:14,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,309 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-28 10:10:14,309 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,310 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-28 10:10:14,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,428 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-28 10:10:14,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,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 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-28 10:10:14,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:14,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:14,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:10:14,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:14,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,510 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-28 10:10:14,510 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,899 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-28 10:10:14,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-28 10:10:14,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:10:14,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:10:14,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:14,921 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-28 10:10:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,969 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-28 10:10:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:10:14,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-28 10:10:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,971 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:10:14,971 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:10:14,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:14,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:10:14,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-28 10:10:14,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:10:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-28 10:10:14,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-28 10:10:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,975 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-28 10:10:14,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:10:14,975 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 10:10:14,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:14,975 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,976 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-28 10:10:14,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-28 10:10:14,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:14,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,081 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:15,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:15,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:15,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:15,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:15,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,128 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-28 10:10:15,360 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:10:15,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:10:15,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,361 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-28 10:10:15,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,406 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-28 10:10:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:10:15,407 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-28 10:10:15,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,407 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:10:15,408 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:10:15,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:10:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:10:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-28 10:10:15,411 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-28 10:10:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,412 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-28 10:10:15,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:10:15,412 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 10:10:15,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:10:15,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,412 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-28 10:10:15,413 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,413 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-28 10:10:15,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:15,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,643 INFO 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-28 10:10:15,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:15,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,673 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-28 10:10:15,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:10:15,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:10:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:15,922 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-28 10:10:15,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,948 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:10:15,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:10:15,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-28 10:10:15,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,950 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:10:15,950 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:10:15,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:15,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:10:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:10:15,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:10:15,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-28 10:10:15,953 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-28 10:10:15,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,954 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-28 10:10:15,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:10:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-28 10:10:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:10:15,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,954 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-28 10:10:15,954 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,955 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-28 10:10:15,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,103 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:16,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:16,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:16,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:10:16,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:16,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,170 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,362 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-28 10:10:16,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:16,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:16,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:16,386 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-28 10:10:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,427 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-28 10:10:16,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:16,428 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-28 10:10:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,428 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:10:16,428 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:16,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:16,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:10:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:10:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-28 10:10:16,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-28 10:10:16,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,433 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-28 10:10:16,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:16,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-28 10:10:16,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:10:16,434 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,434 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-28 10:10:16,434 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,434 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-28 10:10:16,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:16,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,664 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,664 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,664 INFO 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-28 10:10:16,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:16,675 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:16,689 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:16,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:16,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,707 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,708 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-28 10:10:16,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:10:16,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:10:16,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:16,896 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-28 10:10:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,948 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-28 10:10:16,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:10:16,949 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-28 10:10:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,950 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:10:16,950 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:10:16,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:10:16,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-28 10:10:16,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:10:16,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-28 10:10:16,953 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-28 10:10:16,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,954 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-28 10:10:16,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:10:16,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-28 10:10:16,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:10:16,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,954 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-28 10:10:16,955 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-28 10:10:16,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:16,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,090 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:17,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,118 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:17,305 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:17,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-28 10:10:17,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:17,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:10:17,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:10:17,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:10:17,326 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-28 10:10:17,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,350 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-28 10:10:17,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:10:17,351 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-28 10:10:17,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,352 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:10:17,352 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:10:17,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:10:17,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:10:17,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:10:17,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:10:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-28 10:10:17,357 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-28 10:10:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,357 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-28 10:10:17,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:10:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-28 10:10:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:10:17,357 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,358 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-28 10:10:17,358 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-28 10:10:17,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,359 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,726 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,726 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,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 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-28 10:10:17,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:17,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:17,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:10:17,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:17,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,769 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,771 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:18,157 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:18,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-28 10:10:18,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:18,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:10:18,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:10:18,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:18,181 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-28 10:10:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:18,203 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-28 10:10:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:10:18,210 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-28 10:10:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:18,211 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:10:18,211 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:10:18,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:10:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-28 10:10:18,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:10:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:10:18,214 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-28 10:10:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:18,214 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:10:18,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:10:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:10:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:10:18,215 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:18,215 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-28 10:10:18,215 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:18,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:18,216 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-28 10:10:18,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:18,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:18,371 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:18,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:18,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,371 INFO 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-28 10:10:18,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:18,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:18,421 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:18,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:18,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:10:18,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,430 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:19,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-28 10:10:19,222 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:19,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:10:19,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:10:19,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:19,224 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-28 10:10:19,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:19,279 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-28 10:10:19,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:19,292 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-28 10:10:19,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:19,293 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:10:19,293 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:10:19,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:19,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:10:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:10:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:10:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-28 10:10:19,298 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-28 10:10:19,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:19,298 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-28 10:10:19,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:10:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-28 10:10:19,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:10:19,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:19,299 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-28 10:10:19,299 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:19,299 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-28 10:10:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:19,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:19,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,647 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:19,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:19,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:19,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,648 INFO 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-28 10:10:19,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:19,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:10:19,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,698 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:20,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-28 10:10:20,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:20,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:10:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:10:20,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:20,020 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-28 10:10:20,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,048 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:10:20,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:10:20,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-28 10:10:20,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,051 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:10:20,051 INFO L226 Difference]: Without dead ends: 18 [2019-02-28 10:10:20,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-28 10:10:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-28 10:10:20,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:10:20,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-28 10:10:20,055 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-28 10:10:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,055 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-28 10:10:20,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:10:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-28 10:10:20,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-28 10:10:20,056 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:20,056 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-28 10:10:20,056 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:20,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-28 10:10:20,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:20,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,235 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,235 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:20,235 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:20,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:20,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,235 INFO 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-28 10:10:20,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:20,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:20,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:10:20,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:20,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:10:20,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:20,276 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-28 10:10:20,735 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:20,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:20,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:20,737 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-28 10:10:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,776 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-28 10:10:20,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:10:20,777 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-28 10:10:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,778 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:10:20,778 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:20,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:20,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:10:20,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:10:20,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-28 10:10:20,782 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-28 10:10:20,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,782 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-28 10:10:20,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-28 10:10:20,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:10:20,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:20,783 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-28 10:10:20,784 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-28 10:10:20,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:20,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,785 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:21,022 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:21,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:21,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:21,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:21,032 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:21,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:21,050 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:21,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:21,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:10:21,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,059 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,552 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:21,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-28 10:10:21,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:21,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:10:21,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:10:21,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:21,574 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-28 10:10:21,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:21,829 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-28 10:10:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:10:21,829 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-28 10:10:21,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:21,830 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:10:21,830 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:10:21,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:21,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:10:21,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-28 10:10:21,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:10:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-28 10:10:21,835 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-28 10:10:21,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:21,835 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-28 10:10:21,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:10:21,835 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-28 10:10:21,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:10:21,836 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,836 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-28 10:10:21,836 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,836 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-28 10:10:21,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:21,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:22,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,526 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:22,526 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:22,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:22,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:22,527 INFO 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-28 10:10:22,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:22,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:22,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:10:22,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:22,568 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:22,568 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:23,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-28 10:10:23,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:23,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:10:23,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:10:23,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:10:23,186 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-28 10:10:23,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:23,213 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-28 10:10:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:23,214 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-28 10:10:23,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:23,215 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:10:23,215 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:10:23,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:10:23,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:10:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:10:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:10:23,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-28 10:10:23,219 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-28 10:10:23,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:23,219 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-28 10:10:23,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:10:23,219 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-28 10:10:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:10:23,220 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:23,220 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-28 10:10:23,220 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:23,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:23,220 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-28 10:10:23,220 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:23,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:23,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:23,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:23,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,432 INFO 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-28 10:10:23,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:23,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:23,474 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:10:23,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:23,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:10:23,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,483 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:24,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-28 10:10:24,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:24,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:10:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:10:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:24,452 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-28 10:10:24,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,482 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-28 10:10:24,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:24,483 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-28 10:10:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,483 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:10:24,483 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 10:10:24,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 10:10:24,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-28 10:10:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:10:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-28 10:10:24,488 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-28 10:10:24,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,489 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-28 10:10:24,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:10:24,489 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-28 10:10:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-28 10:10:24,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,490 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-28 10:10:24,490 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-28 10:10:24,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:24,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:25,210 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:25,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:25,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:25,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:25,211 INFO 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-28 10:10:25,219 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:25,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:25,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:25,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:25,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:10:25,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:25,252 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,252 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:25,775 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-28 10:10:25,795 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:25,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:10:25,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:10:25,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:25,797 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-28 10:10:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:25,834 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-28 10:10:25,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:10:25,835 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-28 10:10:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:25,836 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:10:25,836 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:10:25,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:10:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:10:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:10:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-28 10:10:25,841 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-28 10:10:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:25,841 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-28 10:10:25,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:10:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-28 10:10:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:10:25,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:25,842 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-28 10:10:25,843 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:25,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-28 10:10:25,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:26,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:26,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:26,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,083 INFO 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-28 10:10:26,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:26,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:26,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:10:26,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,133 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:26,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-28 10:10:26,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:26,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:10:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:10:26,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:26,647 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-28 10:10:26,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:26,723 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-28 10:10:26,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:10:26,725 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-28 10:10:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:26,726 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:10:26,726 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:10:26,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:10:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-28 10:10:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:10:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-28 10:10:26,730 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-28 10:10:26,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:26,731 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-28 10:10:26,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:10:26,731 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-28 10:10:26,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:10:26,731 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:26,731 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-28 10:10:26,732 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:26,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:26,732 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-28 10:10:26,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:26,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:26,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:26,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,691 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:27,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:27,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:27,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,698 INFO 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-28 10:10:27,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:27,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:27,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:10:27,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:27,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:10:27,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:27,748 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,748 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:28,211 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:28,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-28 10:10:28,231 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:28,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:28,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:28,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:28,233 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-28 10:10:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,282 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-28 10:10:28,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:10:28,283 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-28 10:10:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,284 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:10:28,284 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:10:28,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:28,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:10:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:10:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:10:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-28 10:10:28,288 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-28 10:10:28,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,288 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-28 10:10:28,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:28,289 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-28 10:10:28,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:10:28,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,289 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-28 10:10:28,290 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:28,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,290 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-28 10:10:28,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:28,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:28,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:28,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:28,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:28,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:28,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:28,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:28,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:28,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:10:28,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:28,626 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,627 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:29,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-28 10:10:29,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:29,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:10:29,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:10:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:29,779 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-28 10:10:29,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:29,834 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-28 10:10:29,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:10:29,837 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-28 10:10:29,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:29,837 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:10:29,837 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:10:29,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:29,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:10:29,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-28 10:10:29,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:10:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:10:29,842 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-28 10:10:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:29,842 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:10:29,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:10:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:10:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:10:29,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:29,843 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-28 10:10:29,843 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:29,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:29,843 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-28 10:10:29,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:29,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:29,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:29,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,102 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:30,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:30,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:30,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,102 INFO 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-28 10:10:30,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-28 10:10:30,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:30,900 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:30,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-28 10:10:30,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:30,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:10:30,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:10:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:10:30,924 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-28 10:10:30,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,983 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-28 10:10:30,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:10:30,983 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-28 10:10:30,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,984 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:10:30,984 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:10:30,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:10:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:10:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:10:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:10:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-28 10:10:30,988 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-28 10:10:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,988 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-28 10:10:30,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:10:30,988 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-28 10:10:30,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:10:30,989 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,989 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-28 10:10:30,989 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:30,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,990 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-28 10:10:30,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:31,280 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:31,281 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:31,281 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:31,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:31,281 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:31,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:31,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:31,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:10:31,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:31,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:10:31,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,364 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:32,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-28 10:10:32,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:32,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:10:32,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:10:32,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:32,103 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-28 10:10:32,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:32,155 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:10:32,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:10:32,156 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-28 10:10:32,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:32,156 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:10:32,156 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:10:32,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:32,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:10:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-28 10:10:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:10:32,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-28 10:10:32,160 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-28 10:10:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:32,161 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-28 10:10:32,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:10:32,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-28 10:10:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:10:32,162 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:32,162 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-28 10:10:32,162 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:32,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-28 10:10:32,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:32,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:33,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:33,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:33,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:33,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:33,094 INFO 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-28 10:10:33,103 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:33,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:33,127 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:33,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:33,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:10:33,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:33,134 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:33,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-28 10:10:33,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:33,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:10:33,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:10:33,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:33,931 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-28 10:10:34,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:34,011 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-28 10:10:34,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:10:34,012 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-28 10:10:34,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:34,012 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:10:34,012 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:10:34,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:10:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:10:34,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:10:34,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-28 10:10:34,018 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-28 10:10:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:34,018 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-28 10:10:34,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:10:34,019 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-28 10:10:34,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:10:34,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:34,019 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-28 10:10:34,019 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:34,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:34,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-28 10:10:34,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:34,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:34,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:34,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:34,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,555 INFO 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-28 10:10:34,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:34,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:10:34,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:34,599 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:35,814 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:35,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:35,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-28 10:10:35,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:35,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:10:35,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:10:35,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:35,834 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-28 10:10:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:35,923 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-28 10:10:35,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:10:35,923 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-28 10:10:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:35,924 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:10:35,924 INFO L226 Difference]: Without dead ends: 30 [2019-02-28 10:10:35,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-28 10:10:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-28 10:10:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:10:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-28 10:10:35,929 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-28 10:10:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:35,929 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-28 10:10:35,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:10:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-28 10:10:35,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-28 10:10:35,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:35,930 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-28 10:10:35,930 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:35,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-28 10:10:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:35,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:35,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:35,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:36,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:36,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:36,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:36,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:36,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 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-28 10:10:36,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:36,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:36,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:10:36,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:36,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:10:36,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,714 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:37,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-28 10:10:37,517 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:37,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:37,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:37,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:37,519 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-28 10:10:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:37,670 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-28 10:10:37,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:10:37,670 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-28 10:10:37,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:37,671 INFO L225 Difference]: With dead ends: 33 [2019-02-28 10:10:37,671 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:10:37,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:10:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:10:37,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:10:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-28 10:10:37,674 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-28 10:10:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:37,675 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-28 10:10:37,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-28 10:10:37,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:10:37,675 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:37,675 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-28 10:10:37,675 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:37,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:37,676 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-28 10:10:37,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:37,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:37,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:38,033 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:38,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:38,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:38,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,034 INFO 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-28 10:10:38,045 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:38,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:38,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:38,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:38,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:10:38,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:38,086 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,087 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:38,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-28 10:10:38,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:38,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:10:38,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:10:38,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:38,999 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-28 10:10:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:39,032 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-28 10:10:39,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:10:39,032 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-28 10:10:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:39,033 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:10:39,033 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 10:10:39,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 10:10:39,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-28 10:10:39,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:10:39,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-28 10:10:39,038 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-28 10:10:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:39,039 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-28 10:10:39,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:10:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-28 10:10:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:10:39,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:39,039 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-28 10:10:39,041 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:39,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-28 10:10:39,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:39,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:39,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:39,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:39,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:39,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:39,782 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:39,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:39,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:39,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:39,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:39,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 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-28 10:10:39,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:39,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:39,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:39,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:10:39,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:40,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-28 10:10:40,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:40,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:10:40,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:10:40,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:10:40,750 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-28 10:10:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:40,835 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-28 10:10:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:10:40,835 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-28 10:10:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:40,836 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:10:40,836 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:10:40,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:10:40,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:10:40,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:10:40,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:10:40,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-28 10:10:40,840 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-28 10:10:40,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:40,840 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-28 10:10:40,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:10:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-28 10:10:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:10:40,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:40,841 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-28 10:10:40,841 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-28 10:10:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:40,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:40,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:41,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:41,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:41,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:41,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:41,258 INFO 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-28 10:10:41,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:41,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:41,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:10:41,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:41,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:10:41,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,341 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:42,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-28 10:10:42,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:42,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:10:42,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:10:42,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:42,433 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-28 10:10:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:42,486 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-28 10:10:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:10:42,487 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-28 10:10:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:42,487 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:10:42,488 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:10:42,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:42,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:10:42,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-28 10:10:42,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:10:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-28 10:10:42,492 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-28 10:10:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:42,492 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-28 10:10:42,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:10:42,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-28 10:10:42,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-28 10:10:42,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:42,493 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-28 10:10:42,493 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:42,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:42,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-28 10:10:42,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:42,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:42,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:42,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:42,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:42,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:43,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:43,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:43,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:43,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:43,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:43,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 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-28 10:10:43,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:43,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:43,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:43,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:43,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:10:43,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:43,192 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:43,193 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:44,247 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:44,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-28 10:10:44,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:44,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:10:44,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:10:44,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:44,268 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-28 10:10:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:44,383 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-28 10:10:44,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:10:44,383 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-28 10:10:44,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:44,383 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:10:44,384 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:10:44,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:10:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:10:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:10:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-28 10:10:44,387 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-28 10:10:44,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:44,388 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-28 10:10:44,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:10:44,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-28 10:10:44,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:10:44,388 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:44,388 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-28 10:10:44,388 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:44,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:44,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-28 10:10:44,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:44,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:44,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:44,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:45,018 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:45,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:45,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:45,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:45,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:45,019 INFO 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-28 10:10:45,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:45,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:45,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:10:45,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:45,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:46,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-28 10:10:46,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:46,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:10:46,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:10:46,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:10:46,178 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-28 10:10:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:46,252 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-28 10:10:46,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:10:46,252 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-28 10:10:46,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:46,253 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:10:46,253 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:10:46,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:10:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:10:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-28 10:10:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:10:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:10:46,257 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-28 10:10:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:46,257 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:10:46,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:10:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:10:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:10:46,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:46,258 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-28 10:10:46,258 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:46,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:46,258 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-28 10:10:46,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:46,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:46,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:47,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:47,037 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:47,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:47,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:47,038 INFO 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-28 10:10:47,046 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:47,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:47,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:10:47,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:47,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:10:47,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:48,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:48,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-28 10:10:48,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:48,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:10:48,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:10:48,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:10:48,349 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-28 10:10:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:48,417 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-28 10:10:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:10:48,417 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-28 10:10:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:48,418 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:10:48,418 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:10:48,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:10:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:10:48,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:10:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:10:48,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-28 10:10:48,422 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-28 10:10:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:48,422 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-28 10:10:48,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:10:48,422 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-28 10:10:48,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:10:48,423 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:48,423 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-28 10:10:48,423 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-28 10:10:48,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:48,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:48,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:49,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:49,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:49,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:49,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:49,035 INFO 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-28 10:10:49,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:49,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:49,090 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:49,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:49,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:10:49,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:49,100 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:50,600 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:50,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-28 10:10:50,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:50,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:10:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:10:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:50,620 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-28 10:10:50,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:50,727 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:10:50,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:10:50,728 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-28 10:10:50,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:50,728 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:10:50,729 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:10:50,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:10:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-28 10:10:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:10:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-28 10:10:50,731 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-28 10:10:50,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:50,732 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-28 10:10:50,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:10:50,732 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-28 10:10:50,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:10:50,732 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:50,732 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-28 10:10:50,732 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:50,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-28 10:10:50,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:50,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:50,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:50,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:50,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:51,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:51,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:51,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:51,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:51,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:51,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:51,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:51,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:10:51,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:51,320 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:51,320 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:52,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:52,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-28 10:10:52,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:52,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:10:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:10:52,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:10:52,738 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-28 10:10:52,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:52,807 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-28 10:10:52,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:10:52,808 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-28 10:10:52,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:52,808 INFO L225 Difference]: With dead ends: 41 [2019-02-28 10:10:52,809 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:10:52,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:10:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:10:52,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:10:52,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:10:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-28 10:10:52,812 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-28 10:10:52,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:52,812 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-28 10:10:52,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:10:52,812 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-28 10:10:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:10:52,813 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:52,813 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-28 10:10:52,813 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:52,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-28 10:10:52,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:52,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:52,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:52,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:53,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:53,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:53,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:53,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:53,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:53,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:53,468 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:53,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:53,559 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:10:53,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:53,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:10:53,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:53,569 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:55,263 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-28 10:10:55,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:55,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:10:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:10:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:55,283 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-28 10:10:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:55,335 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-28 10:10:55,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:10:55,336 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-28 10:10:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:55,337 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:10:55,337 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:10:55,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:10:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-28 10:10:55,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:10:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-28 10:10:55,339 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-28 10:10:55,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:55,339 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-28 10:10:55,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:10:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-28 10:10:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:10:55,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:55,340 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-28 10:10:55,340 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:55,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:55,341 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-28 10:10:55,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:55,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:55,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:55,342 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:55,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:56,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:56,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:56,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:56,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:56,317 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:56,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:56,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:10:56,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,327 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:58,047 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:58,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:58,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-28 10:10:58,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:58,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:10:58,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:10:58,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:10:58,068 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-28 10:10:58,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:58,139 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-28 10:10:58,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:10:58,140 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-28 10:10:58,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:58,141 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:10:58,141 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:10:58,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:10:58,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:10:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:10:58,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:10:58,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-28 10:10:58,144 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-28 10:10:58,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:58,144 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-28 10:10:58,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:10:58,145 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-28 10:10:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:10:58,145 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:58,145 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-28 10:10:58,146 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-28 10:10:58,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:58,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:58,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:58,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:58,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:58,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:58,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:58,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:58,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:58,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:10:58,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:58,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:59,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:59,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:10:59,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:59,029 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:00,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:00,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-28 10:11:00,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:00,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:11:00,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:11:00,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:00,828 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-28 10:11:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:00,905 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-28 10:11:00,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:11:00,905 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-28 10:11:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:00,906 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:11:00,906 INFO L226 Difference]: Without dead ends: 42 [2019-02-28 10:11:00,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-28 10:11:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-28 10:11:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-28 10:11:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-28 10:11:00,909 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-28 10:11:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:00,910 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-28 10:11:00,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:11:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-28 10:11:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-28 10:11:00,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:00,910 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-28 10:11:00,911 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-28 10:11:00,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:00,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:01,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:01,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:01,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:11:01,595 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:01,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:01,698 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:11:01,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:01,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:11:01,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:01,710 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,710 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:03,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:03,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-28 10:11:03,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:03,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:11:03,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:11:03,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:03,429 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-28 10:11:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:03,492 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-28 10:11:03,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:11:03,493 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-28 10:11:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:03,493 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:11:03,493 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:11:03,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:03,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:11:03,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:11:03,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:11:03,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-28 10:11:03,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-28 10:11:03,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:03,497 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-28 10:11:03,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:11:03,497 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-28 10:11:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:11:03,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:03,498 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-28 10:11:03,498 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:03,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:03,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-28 10:11:03,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:03,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:04,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:04,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:04,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,194 INFO 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-28 10:11:04,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:04,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:04,240 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:04,240 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:04,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:11:04,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,249 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:06,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:06,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-28 10:11:06,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:06,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:11:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:11:06,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:06,178 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-28 10:11:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:06,247 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-28 10:11:06,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:11:06,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-28 10:11:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:06,248 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:11:06,248 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:11:06,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:11:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-28 10:11:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:11:06,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-28 10:11:06,252 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-28 10:11:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:06,252 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-28 10:11:06,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:11:06,252 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-28 10:11:06,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:11:06,252 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:06,252 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-28 10:11:06,253 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:06,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:06,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-28 10:11:06,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:06,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,253 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:06,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:06,898 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:06,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:06,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:06,899 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:06,899 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:06,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:06,899 INFO 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-28 10:11:06,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:06,911 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:06,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:11:06,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:06,956 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:06,956 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:08,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:08,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-28 10:11:08,768 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:08,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:11:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:11:08,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:11:08,769 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-28 10:11:08,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:08,866 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-28 10:11:08,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:11:08,868 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-28 10:11:08,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:08,868 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:11:08,868 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:11:08,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:11:08,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:11:08,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:11:08,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:11:08,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-28 10:11:08,870 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-28 10:11:08,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:08,871 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-28 10:11:08,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:11:08,871 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-28 10:11:08,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:11:08,871 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:08,871 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-28 10:11:08,871 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:08,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:08,871 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-28 10:11:08,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:08,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:08,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:08,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:08,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:09,706 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:09,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:09,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:09,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:09,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:09,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:09,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:11:09,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:09,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:09,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:11:09,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:09,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:11:09,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:09,877 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:09,877 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:12,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-28 10:11:12,068 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:12,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:11:12,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:11:12,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:12,069 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-28 10:11:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:12,143 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-28 10:11:12,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:11:12,143 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-28 10:11:12,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:12,144 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:11:12,144 INFO L226 Difference]: Without dead ends: 46 [2019-02-28 10:11:12,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-28 10:11:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-28 10:11:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:11:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:11:12,148 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-28 10:11:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:12,148 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:11:12,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:11:12,148 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:11:12,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:11:12,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:12,149 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-28 10:11:12,149 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:12,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:12,149 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-28 10:11:12,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:12,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:12,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:12,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:12,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:12,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:12,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:12,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:12,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:12,926 INFO 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-28 10:11:12,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:12,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:12,978 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:12,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:12,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:11:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:12,990 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,991 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:15,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:15,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-28 10:11:15,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:15,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:11:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:11:15,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:15,086 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-28 10:11:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:15,178 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-28 10:11:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:11:15,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-28 10:11:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:15,179 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:11:15,179 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:11:15,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:15,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:11:15,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:11:15,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:11:15,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-28 10:11:15,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-28 10:11:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:15,181 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-28 10:11:15,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:11:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-28 10:11:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:11:15,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:15,182 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-28 10:11:15,182 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:15,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-28 10:11:15,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:15,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:15,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:15,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:15,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:15,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:15,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:15,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:15,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:15,982 INFO 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-28 10:11:15,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:15,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:16,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:11:16,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:16,041 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:18,057 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-28 10:11:18,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:18,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:11:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:11:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:11:18,077 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-28 10:11:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:18,152 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:11:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:11:18,153 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-28 10:11:18,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:18,153 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:11:18,154 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:11:18,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:11:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:11:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-28 10:11:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:11:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-28 10:11:18,157 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-28 10:11:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:18,157 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-28 10:11:18,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:11:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-28 10:11:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:11:18,158 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:18,158 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-28 10:11:18,158 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-28 10:11:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:18,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:19,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:19,035 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:19,035 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:19,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:19,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:19,035 INFO 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-28 10:11:19,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:19,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:19,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:11:19,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:19,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:11:19,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:19,204 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:21,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:21,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-28 10:11:21,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:21,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:11:21,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:11:21,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:21,595 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-28 10:11:21,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:21,720 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-28 10:11:21,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:11:21,721 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-28 10:11:21,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:21,721 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:11:21,722 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:11:21,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:11:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:11:21,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:11:21,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-28 10:11:21,725 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-28 10:11:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:21,726 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-28 10:11:21,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:11:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-28 10:11:21,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:11:21,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:21,726 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-28 10:11:21,726 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:21,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-28 10:11:21,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:21,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:21,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:21,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:24,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:24,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:24,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:24,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:24,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:24,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:24,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:11:24,015 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:24,015 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:24,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:24,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:24,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:11:24,058 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:24,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:24,069 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:26,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:26,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-28 10:11:26,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:26,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:11:26,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:11:26,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:26,630 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-28 10:11:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:26,926 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-28 10:11:26,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:11:26,926 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-28 10:11:26,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:26,927 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:11:26,927 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:11:26,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:11:26,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-28 10:11:26,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:11:26,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-28 10:11:26,931 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-28 10:11:26,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:26,932 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-28 10:11:26,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:11:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-28 10:11:26,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-28 10:11:26,932 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:26,932 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-28 10:11:26,933 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:26,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:26,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-28 10:11:26,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:26,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:26,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:26,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:28,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:28,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:28,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:28,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:28,211 INFO 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-28 10:11:28,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:28,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:28,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:11:28,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:28,278 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:30,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:30,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-28 10:11:30,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:30,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:11:30,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:11:30,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:11:30,868 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-28 10:11:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:30,957 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-28 10:11:30,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:11:30,958 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-28 10:11:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:30,959 INFO L225 Difference]: With dead ends: 53 [2019-02-28 10:11:30,959 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:11:30,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:11:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:11:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:11:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:11:30,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-28 10:11:30,962 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-28 10:11:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:30,962 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-28 10:11:30,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:11:30,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-28 10:11:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:11:30,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:30,963 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-28 10:11:30,963 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:30,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-28 10:11:30,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:30,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:30,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:31,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:31,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:31,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:31,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:31,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:31,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:31,974 INFO 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-28 10:11:31,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:31,983 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:32,162 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:11:32,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:32,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:11:32,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:32,175 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:34,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:34,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-28 10:11:34,643 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:34,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:11:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:11:34,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:34,644 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-28 10:11:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:34,704 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-28 10:11:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:11:34,704 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-28 10:11:34,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:34,705 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:11:34,705 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:11:34,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:34,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:11:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-28 10:11:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:11:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-28 10:11:34,708 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-28 10:11:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:34,708 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-28 10:11:34,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:11:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-28 10:11:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:11:34,709 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:34,709 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-28 10:11:34,709 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:34,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-28 10:11:34,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:34,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:34,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:34,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:36,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:36,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:36,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:36,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:36,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:36,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:36,046 INFO 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-28 10:11:36,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:36,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:36,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:36,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:36,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:11:36,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:36,111 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:38,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:38,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-28 10:11:38,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:38,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:11:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:11:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:38,612 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-28 10:11:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:38,751 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-28 10:11:38,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:11:38,751 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-28 10:11:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:38,752 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:11:38,752 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:11:38,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:38,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:11:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:11:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:11:38,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-28 10:11:38,757 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-28 10:11:38,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:38,757 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-28 10:11:38,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:11:38,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-28 10:11:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:11:38,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:38,758 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-28 10:11:38,758 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-28 10:11:38,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:38,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:38,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:38,760 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:39,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:39,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:39,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:39,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:39,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:39,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:39,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:11:39,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:39,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:39,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:11:39,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:39,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:39,950 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:43,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:43,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-28 10:11:43,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:43,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:11:43,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:11:43,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:43,135 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-28 10:11:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:43,194 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-28 10:11:43,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:11:43,194 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-28 10:11:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:43,195 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:11:43,195 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:11:43,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:43,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:11:43,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-28 10:11:43,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:11:43,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-28 10:11:43,199 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-28 10:11:43,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:43,199 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-28 10:11:43,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:11:43,199 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-28 10:11:43,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-28 10:11:43,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:43,200 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-28 10:11:43,200 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:43,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:43,201 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-28 10:11:43,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:43,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:43,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:43,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:44,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:44,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:44,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:44,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:44,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:44,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:44,230 INFO 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-28 10:11:44,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:44,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:44,446 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:11:44,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:44,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:11:44,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:44,462 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:47,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:47,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-28 10:11:47,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:47,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:11:47,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:11:47,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:11:47,590 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-28 10:11:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:47,764 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-28 10:11:47,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:11:47,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-28 10:11:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:47,766 INFO L225 Difference]: With dead ends: 57 [2019-02-28 10:11:47,766 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:11:47,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:11:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:11:47,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:11:47,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:11:47,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-28 10:11:47,769 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-28 10:11:47,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:47,769 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-28 10:11:47,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-28 10:11:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:11:47,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:47,770 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-28 10:11:47,770 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-28 10:11:47,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:47,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:47,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:47,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:47,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:49,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:49,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:49,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:49,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:49,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:49,030 INFO 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-28 10:11:49,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:49,040 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:49,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:49,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:49,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:11:49,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:49,103 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:52,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:52,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:52,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-28 10:11:52,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:52,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:11:52,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:11:52,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:11:52,240 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-28 10:11:52,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:52,334 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-28 10:11:52,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:11:52,335 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-28 10:11:52,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:52,335 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:11:52,335 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:11:52,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:11:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:11:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-28 10:11:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:11:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:11:52,338 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-28 10:11:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:52,338 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:11:52,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:11:52,338 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:11:52,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:11:52,339 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:52,339 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-28 10:11:52,339 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:52,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:52,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-28 10:11:52,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:52,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:52,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:52,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:53,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:53,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:53,490 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:53,490 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:53,490 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:53,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:53,490 INFO 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-28 10:11:53,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:53,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:53,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:53,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:11:53,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:53,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:53,577 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:56,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:56,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:56,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-28 10:11:56,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:56,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:11:56,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:11:56,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:11:56,687 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-28 10:11:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:56,783 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-28 10:11:56,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:11:56,783 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-28 10:11:56,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:56,783 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:11:56,784 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:11:56,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:11:56,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:11:56,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:11:56,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:11:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-28 10:11:56,787 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-28 10:11:56,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:56,787 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-28 10:11:56,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:11:56,787 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-28 10:11:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:11:56,787 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:56,788 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-28 10:11:56,788 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:56,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-28 10:11:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:56,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:56,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:56,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:58,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:58,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:58,057 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:58,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:58,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:58,057 INFO 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-28 10:11:58,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:58,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:58,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-28 10:11:58,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:58,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:11:58,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:58,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:58,335 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:01,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:01,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-28 10:12:01,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:01,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:12:01,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:12:01,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:01,666 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-28 10:12:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:01,741 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:12:01,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:12:01,741 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-28 10:12:01,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:01,742 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:12:01,742 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:12:01,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:12:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-28 10:12:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-28 10:12:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-28 10:12:01,746 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-28 10:12:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:01,746 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-28 10:12:01,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:12:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-28 10:12:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-28 10:12:01,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:01,746 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-28 10:12:01,747 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-28 10:12:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:01,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:01,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:03,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:03,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:03,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:03,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:03,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:03,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:03,447 INFO 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-28 10:12:03,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:03,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:03,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:03,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:03,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:12:03,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:03,517 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:06,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:06,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:06,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-28 10:12:06,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:06,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:12:06,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:12:06,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:06,934 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-28 10:12:07,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:07,027 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-28 10:12:07,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:12:07,027 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-28 10:12:07,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:07,028 INFO L225 Difference]: With dead ends: 61 [2019-02-28 10:12:07,028 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:12:07,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:12:07,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:12:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:12:07,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-28 10:12:07,030 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-28 10:12:07,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:07,031 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-28 10:12:07,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:12:07,031 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-28 10:12:07,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:12:07,031 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:07,031 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-28 10:12:07,031 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:07,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:07,032 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-28 10:12:07,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:07,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:07,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:07,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:07,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:07,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:08,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:08,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:08,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:08,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:08,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:08,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 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-28 10:12:08,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:08,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:08,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:12:08,999 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:09,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:09,008 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:12,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:12,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:12,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-28 10:12:12,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:12,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:12:12,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:12:12,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:12,462 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-28 10:12:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:12,578 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-28 10:12:12,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:12:12,578 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-28 10:12:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:12,579 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:12:12,579 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:12:12,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:12:12,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-28 10:12:12,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:12:12,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-28 10:12:12,582 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-28 10:12:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:12,582 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-28 10:12:12,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:12:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-28 10:12:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:12:12,583 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:12,583 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-28 10:12:12,583 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:12,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:12,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-28 10:12:12,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:12,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:12,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:12,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:13,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:13,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:13,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:13,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:13,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:13,765 INFO 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-28 10:12:13,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:13,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:14,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:12:14,048 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:14,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:12:14,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:14,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:17,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:17,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:17,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-28 10:12:17,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:17,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:12:17,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:12:17,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:17,590 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-28 10:12:17,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:17,664 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-28 10:12:17,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:12:17,665 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-28 10:12:17,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:17,665 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:12:17,666 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:12:17,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:12:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:12:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:12:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-28 10:12:17,669 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-28 10:12:17,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:17,669 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-28 10:12:17,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:12:17,670 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-28 10:12:17,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:12:17,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:17,670 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-28 10:12:17,670 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:17,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:17,671 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-28 10:12:17,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:17,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:17,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:17,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:17,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:19,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:19,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:19,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:19,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:19,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:19,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:19,234 INFO 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-28 10:12:19,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:19,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:19,304 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:19,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:19,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:12:19,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:19,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:19,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:23,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:23,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-28 10:12:23,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:23,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:12:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:12:23,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:23,897 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-28 10:12:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:24,005 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-28 10:12:24,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:12:24,005 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-28 10:12:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:24,006 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:12:24,006 INFO L226 Difference]: Without dead ends: 62 [2019-02-28 10:12:24,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-28 10:12:24,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-28 10:12:24,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:12:24,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-28 10:12:24,008 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-28 10:12:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:24,009 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-28 10:12:24,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:12:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-28 10:12:24,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-28 10:12:24,010 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:24,010 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-28 10:12:24,011 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:24,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:24,011 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-28 10:12:24,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:24,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:24,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:24,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:24,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:25,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:25,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:25,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:25,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:25,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:25,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:25,742 INFO 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-28 10:12:25,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:25,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:25,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:12:25,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:25,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:25,821 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:29,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:29,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-28 10:12:29,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:29,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:12:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:12:29,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:12:29,868 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-28 10:12:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:29,961 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-28 10:12:29,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:12:29,962 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-28 10:12:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:29,962 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:12:29,962 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:12:29,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:12:29,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:12:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:12:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:12:29,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-28 10:12:29,965 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-28 10:12:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:29,966 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-28 10:12:29,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:12:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-28 10:12:29,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:12:29,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:29,966 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-28 10:12:29,967 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-28 10:12:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:29,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:29,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:29,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:29,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:31,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:31,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:31,334 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:31,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:31,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:31,334 INFO 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-28 10:12:31,344 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:31,344 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:31,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-28 10:12:31,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:31,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:12:31,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:31,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:31,697 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:35,620 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:35,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:35,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-28 10:12:35,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:35,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:12:35,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:12:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:35,642 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-28 10:12:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:35,718 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-28 10:12:35,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:12:35,719 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-28 10:12:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:35,719 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:12:35,719 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:12:35,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:12:35,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-28 10:12:35,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:12:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-28 10:12:35,722 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-28 10:12:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:35,722 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-28 10:12:35,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:12:35,723 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-28 10:12:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:12:35,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:35,723 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-28 10:12:35,723 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-28 10:12:35,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:35,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:35,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:37,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:37,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:37,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:37,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:37,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:37,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:37,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:12:37,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:37,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:37,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:37,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:37,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:12:37,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:37,516 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:41,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:41,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-28 10:12:41,365 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:41,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:12:41,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:12:41,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:12:41,366 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-28 10:12:41,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:41,480 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-28 10:12:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:12:41,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-28 10:12:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:41,481 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:12:41,481 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:12:41,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:12:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:12:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:12:41,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:12:41,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-28 10:12:41,483 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-28 10:12:41,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:41,483 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-28 10:12:41,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:12:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-28 10:12:41,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:12:41,484 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:41,484 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-28 10:12:41,484 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:41,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:41,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-28 10:12:41,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:41,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:41,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:41,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:41,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:43,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:43,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:43,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:43,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:43,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:43,380 INFO 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-28 10:12:43,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:43,389 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:43,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:12:43,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:43,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:43,454 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:47,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:47,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-28 10:12:47,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:47,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:12:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:12:47,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:12:47,718 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-28 10:12:47,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:47,875 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-28 10:12:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:12:47,875 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-28 10:12:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:47,876 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:12:47,876 INFO L226 Difference]: Without dead ends: 66 [2019-02-28 10:12:47,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:12:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-28 10:12:47,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-28 10:12:47,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:12:47,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:12:47,879 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-28 10:12:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:47,879 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:12:47,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:12:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:12:47,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:12:47,880 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:47,880 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-28 10:12:47,880 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:47,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:47,880 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-28 10:12:47,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:47,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:47,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:47,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:47,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:49,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:49,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:49,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:49,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:49,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:49,360 INFO 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-28 10:12:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:49,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:49,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:12:49,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:49,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:12:49,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:49,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:49,753 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-28 10:12:54,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:54,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:12:54,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:12:54,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:12:54,075 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-28 10:12:54,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:54,194 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-28 10:12:54,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:12:54,194 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-28 10:12:54,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:54,195 INFO L225 Difference]: With dead ends: 69 [2019-02-28 10:12:54,195 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:12:54,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:12:54,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:12:54,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:12:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:12:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-28 10:12:54,198 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-28 10:12:54,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:54,198 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-28 10:12:54,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:12:54,198 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-28 10:12:54,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:12:54,199 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:54,199 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-28 10:12:54,199 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:54,199 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-28 10:12:54,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:54,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:54,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:55,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:55,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:55,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:55,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:55,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:55,700 INFO 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-28 10:12:55,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:55,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:55,797 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:55,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:55,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:12:55,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:55,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:55,809 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:00,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:00,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-28 10:13:00,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:00,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:13:00,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:13:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:00,235 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-28 10:13:00,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:00,353 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:13:00,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:13:00,357 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-28 10:13:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:00,358 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:13:00,358 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:13:00,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:00,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:13:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-28 10:13:00,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:13:00,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-28 10:13:00,363 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-28 10:13:00,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:00,363 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-28 10:13:00,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:13:00,364 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-28 10:13:00,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:13:00,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:00,364 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-28 10:13:00,364 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:00,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:00,365 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-28 10:13:00,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:00,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:00,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:00,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:01,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:01,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:01,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:01,992 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:01,992 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:01,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:01,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:13:02,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:02,004 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:02,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:13:02,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:02,076 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-28 10:13:06,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:06,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:13:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:13:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:13:06,764 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-28 10:13:06,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:06,859 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-28 10:13:06,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:13:06,859 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-28 10:13:06,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:06,860 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:13:06,860 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:13:06,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:13:06,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:13:06,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:13:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:13:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-28 10:13:06,864 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-28 10:13:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:06,865 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-28 10:13:06,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:13:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-28 10:13:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:13:06,865 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:06,865 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-28 10:13:06,865 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:06,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:06,866 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-28 10:13:06,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:06,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:06,867 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:09,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:09,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:09,357 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:09,358 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:09,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:09,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:09,358 INFO 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-28 10:13:09,366 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:09,366 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:09,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:13:09,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:09,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:13:09,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:09,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:09,841 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:15,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:15,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-28 10:13:15,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:15,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:13:15,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:13:15,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:15,269 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-28 10:13:15,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:15,374 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-28 10:13:15,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:13:15,375 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-28 10:13:15,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:15,375 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:13:15,375 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:13:15,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:15,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:13:15,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-28 10:13:15,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:13:15,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-28 10:13:15,378 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-28 10:13:15,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:15,379 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-28 10:13:15,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:13:15,379 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-28 10:13:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:13:15,379 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:15,380 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-28 10:13:15,380 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:15,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:15,380 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-28 10:13:15,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:15,381 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:15,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:15,381 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:15,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:17,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:17,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:17,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:17,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:17,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:17,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:17,049 INFO 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-28 10:13:17,058 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:17,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:17,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:17,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:17,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:13:17,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:17,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:17,130 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:22,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-28 10:13:22,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:22,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:13:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:13:22,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:13:22,102 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-28 10:13:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:22,382 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-28 10:13:22,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:13:22,383 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-28 10:13:22,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:22,383 INFO L225 Difference]: With dead ends: 73 [2019-02-28 10:13:22,383 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:13:22,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:13:22,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:13:22,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:13:22,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:13:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-28 10:13:22,386 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-28 10:13:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:22,386 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-28 10:13:22,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:13:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-28 10:13:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:13:22,386 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:22,386 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-28 10:13:22,387 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-28 10:13:22,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:22,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:22,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:22,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:24,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:24,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:24,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:24,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:24,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:24,385 INFO 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-28 10:13:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:24,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:24,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:24,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:13:24,463 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:24,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:24,479 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:29,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:29,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:29,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-28 10:13:29,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:29,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:13:29,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:13:29,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:13:29,726 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-28 10:13:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:29,821 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-28 10:13:29,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:13:29,821 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-28 10:13:29,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:29,822 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:13:29,822 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:13:29,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:13:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:13:29,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-28 10:13:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:13:29,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-28 10:13:29,826 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-28 10:13:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:29,826 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-28 10:13:29,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:13:29,827 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-28 10:13:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:13:29,827 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:29,827 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-28 10:13:29,827 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-28 10:13:29,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:29,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:29,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:31,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:31,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:31,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:31,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:31,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:31,572 INFO 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-28 10:13:31,581 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:31,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:32,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-28 10:13:32,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:32,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:13:32,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:32,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:32,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:37,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:37,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-28 10:13:37,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:37,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:13:37,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:13:37,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:37,299 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-28 10:13:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:37,509 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-28 10:13:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:13:37,509 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-28 10:13:37,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:37,510 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:13:37,510 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:13:37,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:37,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:13:37,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:13:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:13:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-28 10:13:37,513 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-28 10:13:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:37,513 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-28 10:13:37,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:13:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-28 10:13:37,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:13:37,513 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:37,513 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-28 10:13:37,514 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:37,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:37,514 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-28 10:13:37,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:37,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:37,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:37,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:37,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:37,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:39,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:39,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:39,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:39,460 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:39,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:39,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:39,460 INFO 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-28 10:13:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:39,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:39,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:39,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:39,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:13:39,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:39,550 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:44,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:44,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-28 10:13:44,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:44,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:13:44,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:13:44,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:13:44,850 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-28 10:13:45,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:45,010 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-28 10:13:45,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:13:45,011 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-28 10:13:45,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:45,012 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:13:45,012 INFO L226 Difference]: Without dead ends: 74 [2019-02-28 10:13:45,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:13:45,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-28 10:13:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-28 10:13:45,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:13:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-28 10:13:45,016 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-28 10:13:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:45,017 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-28 10:13:45,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:13:45,017 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-28 10:13:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-28 10:13:45,017 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:45,017 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-28 10:13:45,018 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:45,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:45,018 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-28 10:13:45,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:45,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:45,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:47,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:47,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:47,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:47,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:47,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:47,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:13:47,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:47,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:47,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:13:47,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:47,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:52,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:52,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:52,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-28 10:13:52,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:52,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:13:52,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:13:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:13:52,686 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-28 10:13:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:52,902 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-28 10:13:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:13:52,902 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-28 10:13:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:52,903 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:13:52,903 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:13:52,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:13:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:13:52,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:13:52,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:13:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-28 10:13:52,908 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-28 10:13:52,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:52,908 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-28 10:13:52,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:13:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-28 10:13:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:13:52,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:52,909 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-28 10:13:52,909 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:52,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-28 10:13:52,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:52,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:52,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:55,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:55,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:55,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:55,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:55,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:55,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:55,015 INFO 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-28 10:13:55,024 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:55,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:55,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-28 10:13:55,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:55,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:13:55,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:55,684 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:01,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:01,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:01,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-28 10:14:01,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:01,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:14:01,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:14:01,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:14:01,151 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-28 10:14:01,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:01,291 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-28 10:14:01,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:14:01,291 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-28 10:14:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:01,292 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:14:01,292 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:14:01,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:14:01,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:14:01,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-28 10:14:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:14:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:14:01,296 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-28 10:14:01,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:01,296 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:14:01,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:14:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:14:01,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:14:01,297 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:01,297 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-28 10:14:01,297 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:01,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:01,297 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-28 10:14:01,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:01,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:01,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:01,298 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:03,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:03,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:03,261 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:03,261 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:03,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:03,261 INFO 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-28 10:14:03,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:03,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:03,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:03,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:03,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:14:03,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:03,356 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:09,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:09,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-28 10:14:09,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:09,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:14:09,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:14:09,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:14:09,428 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-28 10:14:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:09,592 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-28 10:14:09,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:14:09,593 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-28 10:14:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:09,593 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:14:09,593 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:14:09,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:14:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:14:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:14:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:14:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-28 10:14:09,596 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-28 10:14:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:09,597 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-28 10:14:09,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:14:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-28 10:14:09,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:14:09,597 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:09,598 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-28 10:14:09,598 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:09,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-28 10:14:09,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:09,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:09,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:09,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:11,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:11,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:11,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:11,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:11,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:11,572 INFO 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-28 10:14:11,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:11,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:11,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:14:11,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:11,676 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:17,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:17,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-28 10:14:17,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:17,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:14:17,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:14:17,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:17,613 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-28 10:14:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:17,780 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:14:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:14:17,780 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-28 10:14:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:17,781 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:14:17,781 INFO L226 Difference]: Without dead ends: 78 [2019-02-28 10:14:17,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-28 10:14:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-28 10:14:17,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:14:17,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-28 10:14:17,784 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-28 10:14:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:17,784 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-28 10:14:17,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:14:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-28 10:14:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-28 10:14:17,784 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:17,784 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-28 10:14:17,785 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:17,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:17,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-28 10:14:17,785 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:17,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:17,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:17,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:17,786 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:20,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:20,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:20,120 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:20,120 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:20,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:20,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:20,121 INFO 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-28 10:14:20,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:20,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:20,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:14:20,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:20,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:14:20,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:20,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:20,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:27,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:27,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-28 10:14:27,161 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:27,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:14:27,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:14:27,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:14:27,163 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-28 10:14:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:27,270 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-28 10:14:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:14:27,271 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-28 10:14:27,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:27,272 INFO L225 Difference]: With dead ends: 81 [2019-02-28 10:14:27,272 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:14:27,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:14:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:14:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:14:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:14:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-28 10:14:27,276 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-28 10:14:27,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:27,277 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-28 10:14:27,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:14:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-28 10:14:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:14:27,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:27,277 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-28 10:14:27,278 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-28 10:14:27,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:27,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:27,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:27,279 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:29,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:29,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:29,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:29,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:29,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:29,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:29,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 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-28 10:14:29,349 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:29,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:29,415 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:29,415 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:29,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:14:29,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:29,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:35,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:35,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-28 10:14:35,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:35,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:14:35,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:14:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:14:35,842 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-28 10:14:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:35,956 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-28 10:14:35,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:14:35,957 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-28 10:14:35,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:35,957 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:14:35,957 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:14:35,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:14:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:14:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-28 10:14:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:14:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-28 10:14:35,961 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-28 10:14:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:35,961 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-28 10:14:35,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:14:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-28 10:14:35,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:14:35,962 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:35,962 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-28 10:14:35,962 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:35,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-28 10:14:35,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:35,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:35,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:35,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:38,169 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-28 10:14:38,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:38,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:38,170 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:38,170 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:38,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:38,170 INFO 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-28 10:14:38,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:38,179 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:38,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:14:38,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:38,267 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-28 10:14:38,268 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:44,444 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-28 10:14:44,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:44,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-28 10:14:44,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:44,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:14:44,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:14:44,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:14:44,465 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-28 10:14:44,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:44,842 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-28 10:14:44,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:14:44,842 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-28 10:14:44,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:44,843 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:14:44,843 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:14:44,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:14:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:14:44,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:14:44,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:14:44,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-28 10:14:44,846 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-28 10:14:44,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:44,846 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-28 10:14:44,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:14:44,846 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-28 10:14:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:14:44,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:44,847 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-28 10:14:44,847 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-28 10:14:44,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:44,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:44,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:44,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:47,208 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:47,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:47,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:47,209 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:47,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:47,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:47,209 INFO 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-28 10:14:47,216 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:47,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:48,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-28 10:14:48,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:48,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:14:48,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:48,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:54,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:54,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:54,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-28 10:14:54,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:54,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:14:54,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:14:54,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:14:54,551 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-28 10:14:55,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:55,142 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-28 10:14:55,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:14:55,142 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-28 10:14:55,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:55,143 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:14:55,143 INFO L226 Difference]: Without dead ends: 82 [2019-02-28 10:14:55,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:14:55,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-28 10:14:55,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-28 10:14:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:14:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-28 10:14:55,147 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-28 10:14:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:55,147 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-28 10:14:55,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:14:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-28 10:14:55,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-28 10:14:55,148 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:55,148 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-28 10:14:55,148 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:55,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-28 10:14:55,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:55,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:55,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:55,150 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:57,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:57,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:57,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:57,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:57,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:57,729 INFO 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-28 10:14:57,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:57,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:57,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:57,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:57,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:14:57,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:57,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:57,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:04,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:04,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-28 10:15:04,664 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:04,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:15:04,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:15:04,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:15:04,666 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-28 10:15:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:04,807 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-28 10:15:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:15:04,807 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-28 10:15:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:04,808 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:15:04,808 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:15:04,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:15:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:15:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:15:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:15:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-28 10:15:04,812 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-28 10:15:04,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:04,812 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-28 10:15:04,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:15:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-28 10:15:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:15:04,813 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:04,813 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-28 10:15:04,813 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-28 10:15:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:04,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:04,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:04,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:07,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:07,445 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:07,445 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:07,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:07,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:07,445 INFO 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-28 10:15:07,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:07,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:07,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:15:07,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:07,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:07,538 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:14,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:14,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-28 10:15:14,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:14,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:15:14,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:15:14,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:14,489 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-28 10:15:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:14,629 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-28 10:15:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:15:14,630 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-28 10:15:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:14,630 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:15:14,630 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:15:14,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:15:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-28 10:15:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:15:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-28 10:15:14,634 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-28 10:15:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:14,634 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-28 10:15:14,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:15:14,634 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-28 10:15:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:15:14,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:14,635 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-28 10:15:14,635 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:14,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:14,635 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-28 10:15:14,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:14,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:14,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:14,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:14,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:17,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:17,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:17,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:17,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:17,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:17,550 INFO 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-28 10:15:17,558 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:17,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:18,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-28 10:15:18,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:18,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:15:18,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:18,463 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:25,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:25,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-28 10:15:25,511 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:25,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:15:25,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:15:25,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:25,513 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-28 10:15:25,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:25,697 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-28 10:15:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:15:25,697 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-28 10:15:25,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:25,697 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:15:25,698 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:15:25,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:15:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:15:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:15:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-28 10:15:25,700 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-28 10:15:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:25,700 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-28 10:15:25,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:15:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-28 10:15:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:15:25,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:25,701 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-28 10:15:25,701 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-28 10:15:25,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:25,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:25,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:28,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:28,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:28,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:28,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:28,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:15:28,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:28,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:28,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:28,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:28,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:15:28,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:28,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,625 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:35,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:35,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-28 10:15:35,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:35,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:15:35,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:15:35,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:15:35,728 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-28 10:15:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:35,903 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-28 10:15:35,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:15:35,904 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-28 10:15:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:35,904 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:15:35,904 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:15:35,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:15:35,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:15:35,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-28 10:15:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:15:35,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:15:35,907 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-28 10:15:35,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:35,907 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:15:35,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:15:35,907 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:15:35,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:15:35,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:35,908 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-28 10:15:35,908 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:35,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:35,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-28 10:15:35,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:35,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:35,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:35,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:38,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:38,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:38,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:38,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:38,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:38,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:38,576 INFO 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-28 10:15:38,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:38,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:38,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-28 10:15:38,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:38,680 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:46,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:46,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:46,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-28 10:15:46,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:46,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:15:46,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:15:46,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:15:46,049 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-28 10:15:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:46,310 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-28 10:15:46,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:15:46,310 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-28 10:15:46,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:46,322 INFO L225 Difference]: With dead ends: 89 [2019-02-28 10:15:46,322 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:15:46,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:15:46,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:15:46,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:15:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:15:46,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-28 10:15:46,324 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-28 10:15:46,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:46,324 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-28 10:15:46,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:15:46,325 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-28 10:15:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:15:46,325 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:46,325 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-28 10:15:46,325 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:46,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:46,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-28 10:15:46,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:46,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:46,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:46,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:49,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:49,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:49,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:49,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:49,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:49,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:49,029 INFO 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-28 10:15:49,038 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:49,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:50,147 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-28 10:15:50,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:50,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:15:50,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:50,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:50,166 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:58,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:58,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-28 10:15:58,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:15:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:15:58,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:15:58,020 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-28 10:15:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:58,165 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:15:58,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:15:58,165 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-28 10:15:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:58,166 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:15:58,166 INFO L226 Difference]: Without dead ends: 88 [2019-02-28 10:15:58,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:15:58,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-28 10:15:58,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-28 10:15:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:15:58,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-28 10:15:58,170 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-28 10:15:58,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:58,170 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-28 10:15:58,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:15:58,170 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-28 10:15:58,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:15:58,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:58,171 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-28 10:15:58,171 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:58,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:58,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-28 10:15:58,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:58,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:58,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:58,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:00,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:00,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:00,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:00,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:00,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:00,730 INFO 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-28 10:16:00,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:00,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:00,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:00,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:00,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:16:00,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:00,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:00,830 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:08,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:08,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:08,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-28 10:16:08,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:08,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:16:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:16:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:16:08,710 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-28 10:16:08,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:08,869 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-28 10:16:08,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:16:08,869 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-28 10:16:08,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:08,870 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:16:08,870 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:16:08,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:16:08,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:16:08,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:16:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:16:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-28 10:16:08,874 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-28 10:16:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:08,874 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-28 10:16:08,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:16:08,874 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-28 10:16:08,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:16:08,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:08,875 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-28 10:16:08,875 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:08,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:08,875 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-28 10:16:08,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:08,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:08,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:08,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:11,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:11,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:11,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:11,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:11,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:11,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:11,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:16:11,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:11,437 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:11,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:11,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:16:11,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:11,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:19,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:19,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-28 10:16:19,817 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:19,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:16:19,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:16:19,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:16:19,819 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-28 10:16:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:20,033 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-28 10:16:20,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:16:20,033 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-28 10:16:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:20,034 INFO L225 Difference]: With dead ends: 92 [2019-02-28 10:16:20,034 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:16:20,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:16:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:16:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-28 10:16:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-28 10:16:20,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-28 10:16:20,037 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-28 10:16:20,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:20,038 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-28 10:16:20,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:16:20,038 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-28 10:16:20,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-28 10:16:20,038 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:20,039 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-28 10:16:20,039 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:20,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:20,039 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-28 10:16:20,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:20,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:20,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:20,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:20,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:23,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:23,139 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:23,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:23,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,139 INFO 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-28 10:16:23,147 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:23,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:24,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-28 10:16:24,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:24,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:16:24,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:24,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:24,337 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:32,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:32,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-28 10:16:32,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:32,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:16:32,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:16:32,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:16:32,407 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-28 10:16:32,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:32,669 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-28 10:16:32,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:16:32,669 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-28 10:16:32,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:32,670 INFO L225 Difference]: With dead ends: 93 [2019-02-28 10:16:32,670 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:16:32,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:16:32,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:16:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:16:32,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:16:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-28 10:16:32,673 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-28 10:16:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:32,673 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-28 10:16:32,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:16:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-28 10:16:32,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:16:32,674 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:32,674 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-28 10:16:32,674 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:32,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:32,674 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-28 10:16:32,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:32,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:32,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:32,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:32,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:35,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:35,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:35,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:35,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:35,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:35,461 INFO 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-28 10:16:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:35,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:35,557 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:35,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:16:35,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:35,575 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:44,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:44,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:44,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-28 10:16:44,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:44,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:16:44,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:16:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:16:44,036 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-28 10:16:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:44,170 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-28 10:16:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:16:44,170 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-28 10:16:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:44,171 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:16:44,171 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:16:44,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:16:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:16:44,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-28 10:16:44,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:16:44,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-28 10:16:44,175 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-28 10:16:44,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:44,175 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-28 10:16:44,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:16:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-28 10:16:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:16:44,176 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:44,176 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-28 10:16:44,176 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:44,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:44,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-28 10:16:44,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:44,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:44,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:44,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:46,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:46,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:46,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:46,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:46,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:46,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:16:46,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:46,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:47,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:16:47,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:47,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:55,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:55,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:55,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-28 10:16:55,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:55,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:16:55,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:16:55,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:16:55,711 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-28 10:16:55,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:55,934 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-28 10:16:55,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:16:55,934 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-28 10:16:55,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:55,935 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:16:55,935 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:16:55,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:16:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:16:55,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:16:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:16:55,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-28 10:16:55,939 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-28 10:16:55,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:55,939 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-28 10:16:55,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:16:55,939 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-28 10:16:55,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:16:55,940 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:55,940 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-28 10:16:55,940 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:55,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:55,941 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-28 10:16:55,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:55,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:55,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:55,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:55,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:58,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:58,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:58,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:58,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:58,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:58,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:58,916 INFO 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-28 10:16:58,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:58,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:00,257 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-28 10:17:00,258 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:00,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:17:00,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:00,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:00,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:09,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:09,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-28 10:17:09,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:09,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:17:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:17:09,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:17:09,100 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-28 10:17:09,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:09,250 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-28 10:17:09,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:17:09,251 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-28 10:17:09,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:09,252 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:17:09,252 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:17:09,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:17:09,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:17:09,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-28 10:17:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:17:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-28 10:17:09,255 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-28 10:17:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:09,255 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-28 10:17:09,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:17:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-28 10:17:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:17:09,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:09,256 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-28 10:17:09,256 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-28 10:17:09,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:09,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:09,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:09,257 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:12,232 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:12,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:12,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:12,233 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:12,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:12,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:12,233 INFO 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-28 10:17:12,242 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:12,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:12,325 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:12,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:12,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:17:12,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:12,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:12,344 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-28 10:17:21,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:21,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:17:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:17:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:17:21,418 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-28 10:17:21,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:21,665 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-28 10:17:21,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:17:21,665 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-28 10:17:21,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:21,666 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:17:21,666 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:17:21,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:17:21,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:17:21,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:17:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:17:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-28 10:17:21,669 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-28 10:17:21,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:21,669 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-28 10:17:21,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:17:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-28 10:17:21,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:17:21,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:21,670 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-28 10:17:21,670 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:21,671 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-28 10:17:21,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:21,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:21,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:21,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:21,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:24,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:24,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:24,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:24,979 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:24,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:24,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 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-28 10:17:24,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:24,988 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:17:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:25,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:17:25,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:25,085 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:34,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:34,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-28 10:17:34,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:34,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:17:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:17:34,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:17:34,307 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-28 10:17:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:34,497 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-28 10:17:34,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-28 10:17:34,497 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-28 10:17:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:34,498 INFO L225 Difference]: With dead ends: 98 [2019-02-28 10:17:34,498 INFO L226 Difference]: Without dead ends: 96 [2019-02-28 10:17:34,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:17:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-28 10:17:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-28 10:17:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:17:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:17:34,502 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-28 10:17:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:34,502 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:17:34,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:17:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:17:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:17:34,503 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:34,503 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-28 10:17:34,503 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:34,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:34,503 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-28 10:17:34,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:34,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:34,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:34,504 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:37,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:37,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:37,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:37,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:37,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:37,693 INFO 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-28 10:17:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:37,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:39,137 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-28 10:17:39,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:39,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:17:39,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:39,157 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:48,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:48,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:48,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-28 10:17:48,262 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:48,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:17:48,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:17:48,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:17:48,264 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-28 10:17:48,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:48,424 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-28 10:17:48,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:17:48,425 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-28 10:17:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:48,425 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:17:48,425 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:17:48,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:17:48,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:17:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:17:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:17:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-28 10:17:48,428 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-28 10:17:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:48,429 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-28 10:17:48,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:17:48,429 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-28 10:17:48,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:17:48,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:48,429 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-28 10:17:48,429 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:48,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:48,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-28 10:17:48,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:48,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:48,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:48,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:51,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:51,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:51,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:51,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:51,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:51,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-28 10:17:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:51,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:51,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:51,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:51,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:17:51,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:51,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:01,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:01,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-28 10:18:01,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:01,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:18:01,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:18:01,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:18:01,589 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-28 10:18:01,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:01,739 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:18:01,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-28 10:18:01,740 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-28 10:18:01,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:01,741 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:18:01,741 INFO L226 Difference]: Without dead ends: 98 [2019-02-28 10:18:01,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:18:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-28 10:18:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-28 10:18:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:18:01,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-28 10:18:01,745 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-28 10:18:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:01,746 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-28 10:18:01,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:18:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-28 10:18:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:18:01,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:01,746 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-28 10:18:01,746 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:01,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:01,747 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-28 10:18:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:01,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:01,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:01,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:05,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:05,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:05,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:05,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:05,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:05,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:05,295 INFO 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-28 10:18:05,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:05,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:05,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:05,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-28 10:18:05,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:05,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:05,407 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:14,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:14,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:14,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-28 10:18:14,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:14,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:18:14,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:18:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:18:14,783 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-28 10:18:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:14,974 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-28 10:18:14,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:18:14,974 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-28 10:18:14,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:14,975 INFO L225 Difference]: With dead ends: 101 [2019-02-28 10:18:14,975 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:18:14,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:18:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:18:14,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:18:14,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:18:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-28 10:18:14,979 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-28 10:18:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:14,980 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-28 10:18:14,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:18:14,980 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-28 10:18:14,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:18:14,981 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:14,981 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-28 10:18:14,981 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:14,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:14,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-28 10:18:14,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:14,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:14,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:14,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:18,322 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:18,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:18,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:18,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:18,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:18,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:18,323 INFO 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-28 10:18:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:18,332 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:20,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-28 10:18:20,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:20,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:18:20,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:20,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:20,053 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:29,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:29,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:29,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-28 10:18:29,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:29,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:18:29,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:18:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:18:29,978 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-28 10:18:30,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:30,141 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-28 10:18:30,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:18:30,143 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-28 10:18:30,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:30,143 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:18:30,143 INFO L226 Difference]: Without dead ends: 100 [2019-02-28 10:18:30,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:18:30,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-28 10:18:30,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-28 10:18:30,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:18:30,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-28 10:18:30,148 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-28 10:18:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:30,148 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-28 10:18:30,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:18:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-28 10:18:30,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:18:30,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:30,149 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-28 10:18:30,150 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:30,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:30,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-28 10:18:30,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:30,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:30,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:30,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:30,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:33,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:33,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:33,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:33,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:33,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:33,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:33,729 INFO 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-28 10:18:33,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:33,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:33,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:33,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:33,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:18:33,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:33,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:33,842 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:44,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:44,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:44,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-28 10:18:44,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:44,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:18:44,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:18:44,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:18:44,127 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-28 10:18:44,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:44,338 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-28 10:18:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:18:44,339 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-28 10:18:44,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:44,339 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:18:44,339 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:18:44,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:18:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:18:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:18:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:18:44,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-28 10:18:44,343 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-28 10:18:44,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:44,343 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-28 10:18:44,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:18:44,343 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-28 10:18:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:18:44,344 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:44,344 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-28 10:18:44,344 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-28 10:18:44,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:44,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:44,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:44,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:44,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:47,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:47,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:47,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:47,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:47,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:47,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:47,958 INFO 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-28 10:18:47,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:47,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:48,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:18:48,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:48,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:48,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:58,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:58,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-28 10:18:58,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:58,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:18:58,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:18:58,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:18:58,173 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-28 10:18:58,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:58,480 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-28 10:18:58,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-28 10:18:58,480 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-28 10:18:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:58,481 INFO L225 Difference]: With dead ends: 104 [2019-02-28 10:18:58,481 INFO L226 Difference]: Without dead ends: 102 [2019-02-28 10:18:58,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:18:58,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-28 10:18:58,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-28 10:18:58,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:18:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-28 10:18:58,485 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-28 10:18:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:58,485 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-28 10:18:58,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:18:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-28 10:18:58,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-28 10:18:58,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:58,486 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-28 10:18:58,486 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:58,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:58,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-28 10:18:58,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:58,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:58,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:58,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:02,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:02,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:02,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:02,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:02,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:02,185 INFO 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-28 10:19:02,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:02,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:04,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-28 10:19:04,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:04,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:19:04,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:04,026 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:14,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:14,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-28 10:19:14,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:14,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:19:14,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:19:14,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:19:14,497 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-28 10:19:14,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:14,758 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-28 10:19:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:19:14,758 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-28 10:19:14,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:14,759 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:19:14,759 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:19:14,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:19:14,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:19:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:19:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:19:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-28 10:19:14,763 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-28 10:19:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:14,763 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-28 10:19:14,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:19:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-28 10:19:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:19:14,763 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:14,763 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-28 10:19:14,764 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:14,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-28 10:19:14,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:14,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:14,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:14,765 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:18,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:18,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:18,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:18,580 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:18,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:18,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:18,581 INFO 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-28 10:19:18,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:18,590 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:18,679 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:18,679 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:18,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 606 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:19:18,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:18,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:29,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:29,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:29,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-28 10:19:29,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:29,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:19:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:19:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:19:29,660 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-28 10:19:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:29,953 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-28 10:19:29,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-28 10:19:29,954 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-28 10:19:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:29,954 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:19:29,954 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:19:29,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:19:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:19:29,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-28 10:19:29,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:19:29,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-28 10:19:29,958 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-28 10:19:29,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:29,959 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-28 10:19:29,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:19:29,959 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-28 10:19:29,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:19:29,959 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:29,960 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-28 10:19:29,960 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:29,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:29,960 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-28 10:19:29,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:29,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:29,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:29,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:29,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:33,920 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:33,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:33,920 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:33,920 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:33,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:33,921 INFO 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-28 10:19:33,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:33,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:34,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:19:34,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:34,037 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:34,038 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:44,978 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:44,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:44,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-28 10:19:44,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:44,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:19:44,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:19:45,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:19:45,000 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-28 10:19:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:45,186 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-28 10:19:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:19:45,186 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-28 10:19:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:45,188 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:19:45,188 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:19:45,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:19:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:19:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:19:45,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:19:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-28 10:19:45,193 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-28 10:19:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:45,193 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-28 10:19:45,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:19:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-28 10:19:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:19:45,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:45,194 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-28 10:19:45,194 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:45,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:45,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-28 10:19:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:45,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:45,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:49,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:49,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:49,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:49,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:49,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:49,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:49,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:19:49,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:49,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:51,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-28 10:19:51,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:51,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:19:51,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:51,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:51,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:02,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:02,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-28 10:20:02,707 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:02,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:20:02,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:20:02,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:20:02,710 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-28 10:20:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:03,065 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-28 10:20:03,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:20:03,066 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-28 10:20:03,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:03,067 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:20:03,067 INFO L226 Difference]: Without dead ends: 106 [2019-02-28 10:20:03,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:20:03,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-28 10:20:03,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-28 10:20:03,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:20:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:20:03,071 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-28 10:20:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:03,071 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:20:03,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:20:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:20:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:20:03,072 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:03,072 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-28 10:20:03,072 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:03,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:03,073 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-28 10:20:03,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:03,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:03,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:03,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:06,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:06,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:06,837 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:06,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:06,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:06,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:06,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:06,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:06,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:06,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:06,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-28 10:20:06,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:06,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:06,967 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:18,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:18,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-28 10:20:18,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:18,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:20:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:20:18,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:20:18,817 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-28 10:20:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:19,131 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-28 10:20:19,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:20:19,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-28 10:20:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:19,132 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:20:19,133 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:20:19,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:20:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:20:19,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:20:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:20:19,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-28 10:20:19,138 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-28 10:20:19,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:19,138 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-28 10:20:19,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:20:19,138 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-28 10:20:19,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:20:19,139 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:19,139 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-28 10:20:19,139 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-28 10:20:19,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:19,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:19,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:19,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:23,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:23,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:23,180 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:23,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:23,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:23,180 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:23,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:23,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:20:23,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:23,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:20:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:23,307 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:23,307 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:35,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:35,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-28 10:20:35,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:35,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:20:35,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:20:35,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:20:35,069 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-28 10:20:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:35,316 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:20:35,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-28 10:20:35,316 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-28 10:20:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:35,317 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:20:35,317 INFO L226 Difference]: Without dead ends: 108 [2019-02-28 10:20:35,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:20:35,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-28 10:20:35,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-28 10:20:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:20:35,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-28 10:20:35,321 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-28 10:20:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:35,322 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-28 10:20:35,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:20:35,322 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-28 10:20:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:20:35,322 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:35,322 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-28 10:20:35,322 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:35,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:35,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-28 10:20:35,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:35,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:35,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:35,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:35,323 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:39,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:39,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:39,458 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:39,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:39,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:39,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:39,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:20:39,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:20:41,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-28 10:20:41,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:41,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:20:41,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:41,860 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:53,920 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:53,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:53,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-28 10:20:53,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:53,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:20:53,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:20:53,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:20:53,945 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-28 10:20:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:54,186 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-28 10:20:54,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-28 10:20:54,186 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-28 10:20:54,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:54,187 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:20:54,187 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:20:54,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:20:54,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:20:54,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:20:54,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:20:54,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-28 10:20:54,191 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-28 10:20:54,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:54,191 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-28 10:20:54,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:20:54,191 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-28 10:20:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:20:54,191 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:54,191 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-28 10:20:54,192 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-28 10:20:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:54,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:54,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:54,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:58,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:58,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:58,133 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:58,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:58,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:58,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:20:58,141 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:58,141 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:58,235 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:58,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:58,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-28 10:20:58,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:58,257 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:10,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:10,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-28 10:21:10,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:10,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:21:10,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:21:10,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:21:10,659 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-28 10:21:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:10,905 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-28 10:21:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-28 10:21:10,905 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-28 10:21:10,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:10,906 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:21:10,906 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:21:10,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:21:10,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:21:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-28 10:21:10,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-28 10:21:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-28 10:21:10,909 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-28 10:21:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:10,909 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-28 10:21:10,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:21:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-28 10:21:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-28 10:21:10,909 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:10,910 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-28 10:21:10,910 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:10,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:10,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-28 10:21:10,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:10,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:10,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:10,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:15,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:15,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:15,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:15,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:15,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:15,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:15,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:15,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:15,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 108 conjunts are in the unsatisfiable core [2019-02-28 10:21:15,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:15,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:27,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-28 10:21:27,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:27,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-28 10:21:27,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-28 10:21:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:21:27,593 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-28 10:21:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:27,930 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-28 10:21:27,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-28 10:21:27,930 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-28 10:21:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:27,931 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:21:27,931 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:21:27,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:21:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:21:27,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:21:27,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:21:27,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-28 10:21:27,935 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-28 10:21:27,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:27,935 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-28 10:21:27,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-28 10:21:27,935 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-28 10:21:27,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:21:27,936 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:27,936 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-28 10:21:27,936 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:27,936 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-28 10:21:27,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:27,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:27,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:27,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:32,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:32,392 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:32,392 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:32,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:32,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:32,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:32,401 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:21:32,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:21:35,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-28 10:21:35,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:35,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:21:35,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:35,216 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:47,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:47,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:47,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-28 10:21:47,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:47,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:21:47,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:21:47,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:21:47,869 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-28 10:21:48,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:48,207 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-28 10:21:48,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-28 10:21:48,207 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-28 10:21:48,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:48,208 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:21:48,208 INFO L226 Difference]: Without dead ends: 112 [2019-02-28 10:21:48,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:21:48,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-28 10:21:48,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-28 10:21:48,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:21:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-28 10:21:48,213 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-28 10:21:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:48,213 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-28 10:21:48,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:21:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-28 10:21:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:21:48,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:48,214 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-28 10:21:48,214 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:48,215 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-28 10:21:48,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:48,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:48,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:48,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:52,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:52,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:52,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:52,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:52,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:52,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:52,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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:21:52,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:21:52,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:21:52,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:21:52,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:52,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:21:52,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:52,931 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:52,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:05,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:06,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:06,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-28 10:22:06,019 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:06,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:22:06,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:22:06,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:22:06,022 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-28 10:22:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:06,283 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-28 10:22:06,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-28 10:22:06,284 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-28 10:22:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:06,284 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:22:06,284 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:22:06,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:22:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:22:06,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-28 10:22:06,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:22:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-28 10:22:06,289 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-28 10:22:06,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:06,289 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-28 10:22:06,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:22:06,289 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-28 10:22:06,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:22:06,289 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:06,290 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-28 10:22:06,290 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:06,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:06,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-28 10:22:06,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:06,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:06,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:06,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:06,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:10,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:10,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:10,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:10,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:10,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:10,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:10,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:10,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:10,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:10,807 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:22:10,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:10,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:10,829 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:23,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:23,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-28 10:22:23,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:23,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:22:23,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:22:23,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:22:23,732 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-28 10:22:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:23,957 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-28 10:22:23,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-28 10:22:23,957 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-28 10:22:23,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:23,958 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:22:23,958 INFO L226 Difference]: Without dead ends: 114 [2019-02-28 10:22:23,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:22:23,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-28 10:22:23,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-28 10:22:23,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-28 10:22:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-28 10:22:23,962 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-28 10:22:23,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:23,962 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-28 10:22:23,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:22:23,962 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-28 10:22:23,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-28 10:22:23,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:23,963 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-28 10:22:23,963 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:23,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:23,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-28 10:22:23,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:23,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:23,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:23,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:23,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:28,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:28,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:28,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:28,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:28,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:28,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:28,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:28,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:31,611 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-28 10:22:31,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:31,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-28 10:22:31,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:31,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:31,636 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:44,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:44,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:44,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-02-28 10:22:44,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:44,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:22:44,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:22:44,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:22:44,671 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-02-28 10:22:45,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:45,038 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-28 10:22:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-28 10:22:45,039 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-02-28 10:22:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:45,039 INFO L225 Difference]: With dead ends: 117 [2019-02-28 10:22:45,040 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:22:45,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:22:45,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:22:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-28 10:22:45,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:22:45,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-28 10:22:45,045 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-02-28 10:22:45,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:45,045 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-28 10:22:45,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:22:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-28 10:22:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:22:45,046 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:45,046 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-02-28 10:22:45,046 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:45,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:45,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-02-28 10:22:45,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:45,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:45,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:45,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat