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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:36:47,308 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:36:47,310 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:36:47,322 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:36:47,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:36:47,323 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:36:47,324 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:36:47,326 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:36:47,328 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:36:47,329 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:36:47,330 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:36:47,330 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:36:47,331 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:36:47,332 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:36:47,333 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:36:47,334 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:36:47,335 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:36:47,337 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:36:47,339 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:36:47,341 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:36:47,342 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:36:47,343 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:36:47,345 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:36:47,346 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:36:47,346 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:36:47,347 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:36:47,348 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:36:47,349 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:36:47,350 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:36:47,351 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:36:47,351 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:36:47,352 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:36:47,352 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:36:47,352 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:36:47,354 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:36:47,354 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:36:47,355 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-25 15:36:47,368 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:36:47,368 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:36:47,369 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:36:47,369 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:36:47,370 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:36:47,370 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:36:47,370 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:36:47,370 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:36:47,370 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:36:47,371 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-25 15:36:47,371 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-25 15:36:47,371 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:36:47,371 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:36:47,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:36:47,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:36:47,372 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:36:47,373 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:36:47,373 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:36:47,373 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:36:47,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:36:47,374 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:36:47,374 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:36:47,374 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:36:47,374 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:36:47,375 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:36:47,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:36:47,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:36:47,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:36:47,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:36:47,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:36:47,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:36:47,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:36:47,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:36:47,377 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:36:47,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:36:47,377 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:36:47,377 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:36:47,377 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:36:47,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:36:47,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:36:47,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:36:47,425 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:36:47,425 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:36:47,426 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-25 15:36:47,426 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-02-25 15:36:47,464 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:36:47,466 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:36:47,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:36:47,467 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:36:47,484 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 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,495 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 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,503 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:36:47,504 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:36:47,505 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:36:47,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,517 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,520 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... [2019-02-25 15:36:47,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:36:47,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:36:47,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:36:47,527 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:36:47,529 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:36:47,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:36:47,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:36:47,785 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:36:47,785 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-25 15:36:47,786 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:47 BoogieIcfgContainer [2019-02-25 15:36:47,787 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:36:47,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:36:47,790 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:36:47,794 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:36:47,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:36:47" (1/2) ... [2019-02-25 15:36:47,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2288af27 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:36:47, skipping insertion in model container [2019-02-25 15:36:47,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:36:47" (2/2) ... [2019-02-25 15:36:47,799 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-02-25 15:36:47,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:36:47,819 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:36:47,837 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:36:47,871 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:36:47,871 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:36:47,871 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:36:47,871 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:36:47,872 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:36:47,872 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:36:47,872 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:36:47,872 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:36:47,888 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-25 15:36:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:36:47,894 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:47,896 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:36:47,898 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:47,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:47,905 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-25 15:36:47,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:47,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:47,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:47,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:47,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:36:48,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:36:48,138 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:36:48,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:36:48,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:36:48,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:36:48,159 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-25 15:36:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:48,213 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-25 15:36:48,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:36:48,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:36:48,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:48,236 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:36:48,238 INFO L226 Difference]: Without dead ends: 5 [2019-02-25 15:36:48,241 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-25 15:36:48,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-25 15:36:48,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-25 15:36:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-25 15:36:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-25 15:36:48,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-25 15:36:48,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:48,279 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-25 15:36:48,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:36:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-25 15:36:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:36:48,280 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:48,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:36:48,281 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:48,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-25 15:36:48,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:48,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:48,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:48,283 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:48,415 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-25 15:36:48,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:48,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:48,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:36:48,419 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-25 15:36:48,505 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-25 15:36:48,506 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:36:49,750 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:36:49,752 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-25 15:36:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:49,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:36:49,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:49,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:49,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:49,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:36:49,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:49,820 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-25 15:36:49,820 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:49,961 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-25 15:36:49,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:49,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:36:49,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:49,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:36:49,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:36:49,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:49,984 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-25 15:36:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:50,056 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-25 15:36:50,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:36:50,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:36:50,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:50,057 INFO L225 Difference]: With dead ends: 8 [2019-02-25 15:36:50,057 INFO L226 Difference]: Without dead ends: 6 [2019-02-25 15:36:50,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:36:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-25 15:36:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-25 15:36:50,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:36:50,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-25 15:36:50,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-25 15:36:50,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:50,062 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-25 15:36:50,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:36:50,062 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-25 15:36:50,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:36:50,063 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:50,063 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:36:50,064 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:50,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:50,064 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-25 15:36:50,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:50,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:50,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:50,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:50,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:50,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:50,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:50,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:50,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:50,300 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:50,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:36:50,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:50,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:36:50,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:50,345 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-25 15:36:50,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:50,692 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-25 15:36:50,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:50,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:36:50,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:50,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:36:50,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:36:50,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:50,724 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-25 15:36:50,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:50,771 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-25 15:36:50,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:36:50,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-25 15:36:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:50,772 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:36:50,772 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:36:50,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:36:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:36:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:36:50,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:36:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:36:50,775 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-25 15:36:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:50,776 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:36:50,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:36:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:36:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:36:50,776 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:50,776 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:36:50,777 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:50,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:50,777 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-25 15:36:50,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:50,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:50,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:50,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:50,929 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-25 15:36:50,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:50,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:50,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:50,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:50,931 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:50,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:50,940 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:50,981 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:50,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:50,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:36:50,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:50,989 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-25 15:36:50,989 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,173 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-25 15:36:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:36:51,192 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:36:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:36:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:51,193 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-25 15:36:51,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,215 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-25 15:36:51,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:36:51,216 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-25 15:36:51,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,217 INFO L225 Difference]: With dead ends: 10 [2019-02-25 15:36:51,217 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:36:51,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:36:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:36:51,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-25 15:36:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:36:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-25 15:36:51,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-25 15:36:51,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,221 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-25 15:36:51,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:36:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-25 15:36:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:36:51,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,221 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-25 15:36:51,222 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-25 15:36:51,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:51,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,403 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-25 15:36:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:51,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:51,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:51,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:36:51,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:51,447 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-25 15:36:51,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:51,769 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-25 15:36:51,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:51,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:36:51,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:51,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:36:51,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:36:51,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:51,800 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-25 15:36:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:51,842 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-25 15:36:51,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:36:51,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-25 15:36:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:51,844 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:36:51,844 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:36:51,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:36:51,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:36:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:36:51,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:36:51,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-25 15:36:51,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-25 15:36:51,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:51,846 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-25 15:36:51,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:36:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-25 15:36:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:36:51,848 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:51,848 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-25 15:36:51,849 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-25 15:36:51,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:51,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:51,968 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:51,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:51,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:51,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:51,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:51,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:51,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:51,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:52,044 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:36:52,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:52,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,056 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:52,436 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:36:52,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:52,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:36:52,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:52,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:36:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:36:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:36:52,457 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-25 15:36:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:52,489 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-25 15:36:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:36:52,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-25 15:36:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:52,491 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:36:52,491 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:36:52,491 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-25 15:36:52,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:36:52,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-25 15:36:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:36:52,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-25 15:36:52,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-25 15:36:52,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:52,494 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-25 15:36:52,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:36:52,494 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-25 15:36:52,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:36:52,495 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:52,495 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-25 15:36:52,495 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:52,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:52,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-25 15:36:52,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:52,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:52,496 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:52,684 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-25 15:36:52,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:52,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:52,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:52,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:52,685 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:52,697 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:52,697 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:52,723 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:52,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:52,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:36:52,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:52,731 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-25 15:36:52,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:52,976 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-25 15:36:52,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:52,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:36:52,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:52,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:36:52,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:36:52,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:52,998 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-25 15:36:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,030 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-25 15:36:53,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:36:53,032 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-25 15:36:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,033 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:36:53,033 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:36:53,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:36:53,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:36:53,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:36:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:36:53,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-25 15:36:53,038 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-25 15:36:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,038 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-25 15:36:53,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:36:53,038 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-25 15:36:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:36:53,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,039 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-25 15:36:53,039 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-25 15:36:53,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:53,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:53,213 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-25 15:36:53,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:53,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:53,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:53,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:53,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:53,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:53,228 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:53,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:36:53,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:53,246 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-25 15:36:53,246 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:53,821 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-25 15:36:53,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:53,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:36:53,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:53,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:36:53,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:36:53,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:53,843 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-25 15:36:53,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:53,884 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-25 15:36:53,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:36:53,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-25 15:36:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:53,885 INFO L225 Difference]: With dead ends: 14 [2019-02-25 15:36:53,885 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:36:53,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:36:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:36:53,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-25 15:36:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:36:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-25 15:36:53,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-25 15:36:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:53,889 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-25 15:36:53,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:36:53,889 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-25 15:36:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-25 15:36:53,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:53,890 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-25 15:36:53,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:53,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-25 15:36:53,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:53,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:53,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:53,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,009 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-25 15:36:54,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:54,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:54,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:54,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:36:54,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,055 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,060 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-25 15:36:54,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,300 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-25 15:36:54,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:36:54,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:36:54,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:36:54,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:36:54,322 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-25 15:36:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,345 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:36:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:36:54,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-25 15:36:54,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,346 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:36:54,346 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:36:54,346 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-25 15:36:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:36:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:36:54,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:36:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:36:54,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-25 15:36:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,349 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:36:54,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:36:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:36:54,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:36:54,349 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,349 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-25 15:36:54,350 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,350 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-25 15:36:54,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,485 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-25 15:36:54,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:54,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:54,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:54,521 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:54,521 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:54,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:36:54,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:54,528 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-25 15:36:54,529 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:54,768 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-25 15:36:54,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:54,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:36:54,787 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:54,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:36:54,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:36:54,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:36:54,788 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-25 15:36:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:54,819 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-25 15:36:54,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:36:54,820 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-25 15:36:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:54,821 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:36:54,821 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:36:54,822 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-25 15:36:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:36:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-25 15:36:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:36:54,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-25 15:36:54,825 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-25 15:36:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:54,826 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-25 15:36:54,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:36:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-25 15:36:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-25 15:36:54,826 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:54,826 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-25 15:36:54,827 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-25 15:36:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:54,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:54,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:54,985 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-25 15:36:54,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:54,986 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:54,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:54,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:54,986 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:54,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:54,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:36:55,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:55,016 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-25 15:36:55,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:55,469 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-25 15:36:55,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:55,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:36:55,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:55,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:36:55,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:36:55,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:55,491 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-25 15:36:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:55,527 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-25 15:36:55,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:36:55,528 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-25 15:36:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:55,528 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:36:55,528 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:36:55,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:36:55,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:36:55,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:36:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:36:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-25 15:36:55,532 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-25 15:36:55,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:55,532 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-25 15:36:55,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:36:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-25 15:36:55,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:36:55,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:55,533 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-25 15:36:55,533 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:55,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-25 15:36:55,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:55,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:55,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:55,889 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-25 15:36:55,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:55,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:55,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:55,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:55,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:55,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:55,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:55,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:36:55,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:55,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:36:55,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:55,955 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-25 15:36:55,955 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,256 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-25 15:36:56,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:56,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-25 15:36:56,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:56,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:36:56,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:36:56,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:36:56,279 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-25 15:36:56,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:56,347 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-25 15:36:56,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:36:56,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-25 15:36:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:56,348 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:36:56,348 INFO L226 Difference]: Without dead ends: 16 [2019-02-25 15:36:56,348 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-25 15:36:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-25 15:36:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-25 15:36:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:36:56,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-25 15:36:56,351 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-25 15:36:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:56,352 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-25 15:36:56,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:36:56,352 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-25 15:36:56,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-25 15:36:56,352 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:56,353 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-25 15:36:56,353 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:56,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:56,353 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-25 15:36:56,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:56,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:56,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:56,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:56,530 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-25 15:36:56,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:56,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:56,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:56,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:56,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:56,553 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:56,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:56,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:56,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:56,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:36:56,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:56,592 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-25 15:36:56,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:56,995 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-25 15:36:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:36:57,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:57,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:36:57,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:36:57,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:36:57,017 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-25 15:36:57,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:57,060 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-25 15:36:57,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:36:57,068 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-25 15:36:57,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:57,069 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:36:57,071 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:36:57,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:36:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:36:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:36:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:36:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-25 15:36:57,078 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-25 15:36:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:57,079 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-25 15:36:57,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:36:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-25 15:36:57,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:36:57,079 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:57,080 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-25 15:36:57,080 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:57,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-25 15:36:57,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:57,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:57,345 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-25 15:36:57,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:57,346 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:57,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:57,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:57,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:57,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:57,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:36:57,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:57,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:36:57,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:57,381 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-25 15:36:57,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:58,202 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-25 15:36:58,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:58,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:36:58,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:58,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:36:58,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:36:58,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:36:58,222 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-25 15:36:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:58,320 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-25 15:36:58,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:36:58,322 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-25 15:36:58,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:58,323 INFO L225 Difference]: With dead ends: 20 [2019-02-25 15:36:58,323 INFO L226 Difference]: Without dead ends: 18 [2019-02-25 15:36:58,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:36:58,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-25 15:36:58,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-25 15:36:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:36:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-25 15:36:58,326 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-25 15:36:58,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:58,327 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-25 15:36:58,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:36:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-25 15:36:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-25 15:36:58,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:58,327 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-25 15:36:58,328 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:58,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:58,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-25 15:36:58,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:36:58,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:58,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:58,650 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-25 15:36:58,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:58,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:58,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:58,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:58,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:58,661 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:36:58,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:36:58,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:36:58,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:58,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:36:58,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:58,693 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-25 15:36:58,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:36:59,155 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-25 15:36:59,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:36:59,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-25 15:36:59,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:36:59,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:36:59,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:36:59,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:36:59,177 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-25 15:36:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:36:59,207 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-25 15:36:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:36:59,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-25 15:36:59,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:36:59,209 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:36:59,209 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:36:59,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:36:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:36:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:36:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:36:59,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-25 15:36:59,213 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-25 15:36:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:36:59,213 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-25 15:36:59,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:36:59,214 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-25 15:36:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:36:59,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:36:59,214 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-25 15:36:59,215 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:36:59,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:36:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-25 15:36:59,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:36:59,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:59,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:36:59,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:36:59,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:36:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:36:59,573 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-25 15:36:59,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:59,573 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:36:59,574 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:36:59,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:36:59,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:36:59,574 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:36:59,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:36:59,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:36:59,616 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:36:59,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:36:59,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:36:59,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:36:59,626 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-25 15:36:59,626 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:00,170 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-25 15:37:00,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:00,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:37:00,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:00,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:37:00,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:37:00,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:37:00,197 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-25 15:37:00,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:00,241 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-25 15:37:00,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:37:00,242 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-25 15:37:00,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:00,243 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:37:00,243 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:37:00,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:37:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:37:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-25 15:37:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:37:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-25 15:37:00,247 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-25 15:37:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:00,248 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-25 15:37:00,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:37:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-25 15:37:00,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-25 15:37:00,248 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:00,248 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-25 15:37:00,249 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:00,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-25 15:37:00,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:00,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:00,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:00,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:00,924 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-25 15:37:00,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:00,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:00,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:00,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:00,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:00,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:00,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:00,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:00,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:37:00,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:00,970 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-25 15:37:00,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:02,160 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-25 15:37:02,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:02,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:37:02,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:02,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:37:02,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:37:02,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:02,182 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-25 15:37:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:02,209 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-25 15:37:02,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:37:02,210 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-25 15:37:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:02,210 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:37:02,210 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:37:02,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:37:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:37:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:37:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:37:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-25 15:37:02,213 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-25 15:37:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:02,213 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-25 15:37:02,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:37:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-25 15:37:02,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:37:02,214 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:02,214 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-25 15:37:02,214 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:02,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:02,215 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-25 15:37:02,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:02,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:02,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:02,850 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-25 15:37:02,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:02,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:02,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:02,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:02,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:02,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:02,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:02,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:37:02,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:02,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:37:02,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:02,911 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-25 15:37:02,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:03,992 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-25 15:37:04,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:04,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:37:04,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:04,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:37:04,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:37:04,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:04,015 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-25 15:37:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:04,044 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-25 15:37:04,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:37:04,045 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-25 15:37:04,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:04,045 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:37:04,046 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:37:04,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:37:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:37:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-25 15:37:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:37:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-25 15:37:04,051 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-25 15:37:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:04,051 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-25 15:37:04,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:37:04,051 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-25 15:37:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-25 15:37:04,052 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:04,052 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-25 15:37:04,052 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:04,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:04,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-25 15:37:04,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:04,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:04,054 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:04,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:04,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:04,964 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-25 15:37:04,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:04,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:04,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:04,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:04,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:04,976 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:04,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:05,011 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:05,011 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:05,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:37:05,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:05,020 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-25 15:37:05,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:05,666 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-25 15:37:05,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:05,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:37:05,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:05,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:37:05,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:37:05,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:05,687 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-25 15:37:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:05,725 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-25 15:37:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:37:05,726 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-25 15:37:05,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:05,727 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:37:05,727 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:37:05,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:37:05,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:37:05,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:37:05,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:37:05,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-25 15:37:05,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-25 15:37:05,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:05,731 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-25 15:37:05,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:37:05,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-25 15:37:05,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:37:05,732 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:05,732 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-25 15:37:05,732 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:05,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:05,732 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-25 15:37:05,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:05,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:05,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:05,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:06,053 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-25 15:37:06,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:06,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:06,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:06,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:06,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:06,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:06,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:06,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:06,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:37:06,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:06,110 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-25 15:37:06,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:06,906 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-25 15:37:06,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:06,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:37:06,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:06,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:37:06,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:37:06,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:06,928 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-25 15:37:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:06,970 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-25 15:37:06,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:37:06,972 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-25 15:37:06,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:06,973 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:37:06,973 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:37:06,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:37:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:37:06,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-25 15:37:06,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:37:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-25 15:37:06,977 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-25 15:37:06,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:06,978 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-25 15:37:06,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:37:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-25 15:37:06,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-25 15:37:06,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:06,978 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-25 15:37:06,979 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:06,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:06,979 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-25 15:37:06,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:06,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:06,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:06,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:06,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:07,857 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-25 15:37:07,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:07,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:07,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:07,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:07,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:07,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:07,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:07,901 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:37:07,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:07,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:37:07,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:07,911 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-25 15:37:07,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:08,842 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-25 15:37:08,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:08,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:37:08,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:08,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:37:08,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:37:08,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:08,864 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-25 15:37:08,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:08,910 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:37:08,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:37:08,911 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-25 15:37:08,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:08,911 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:37:08,912 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:37:08,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:37:08,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:37:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:37:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:37:08,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:37:08,915 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-25 15:37:08,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:08,916 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:37:08,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:37:08,916 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:37:08,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:37:08,916 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:08,917 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-25 15:37:08,917 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:08,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:08,917 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-25 15:37:08,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:08,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:08,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:08,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:09,334 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-25 15:37:09,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:09,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:09,335 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:09,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:09,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:09,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:09,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:09,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:09,366 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:09,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:09,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:37:09,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:09,375 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-25 15:37:09,376 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:10,414 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-25 15:37:10,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:10,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:37:10,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:10,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:37:10,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:37:10,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:10,436 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-25 15:37:10,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:10,509 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-25 15:37:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:37:10,513 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-25 15:37:10,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:10,514 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:37:10,514 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:37:10,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:37:10,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:37:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-25 15:37:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:37:10,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-25 15:37:10,518 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-25 15:37:10,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:10,518 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-25 15:37:10,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:37:10,518 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-25 15:37:10,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-25 15:37:10,519 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:10,519 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-25 15:37:10,519 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:10,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:10,519 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-25 15:37:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:10,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:10,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:10,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:10,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:10,915 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-25 15:37:10,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:10,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:10,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:10,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:10,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:10,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:10,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:10,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:37:10,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:10,959 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-25 15:37:10,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:11,901 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-25 15:37:11,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:11,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:37:11,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:11,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:37:11,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:37:11,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:11,922 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-25 15:37:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:11,961 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-25 15:37:11,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:37:11,963 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-25 15:37:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:11,963 INFO L225 Difference]: With dead ends: 29 [2019-02-25 15:37:11,963 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:37:11,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:37:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:37:11,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:37:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:37:11,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-25 15:37:11,967 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-25 15:37:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:11,967 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-25 15:37:11,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:37:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-25 15:37:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:37:11,968 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:11,968 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-25 15:37:11,968 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-25 15:37:11,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:11,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:11,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:11,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:11,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:12,424 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-25 15:37:12,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:12,425 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:12,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:12,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:12,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:12,439 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:12,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:12,487 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:37:12,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:12,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:37:12,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:12,495 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-25 15:37:12,495 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:13,890 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-25 15:37:13,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:13,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-25 15:37:13,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:13,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:37:13,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:37:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:13,912 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-25 15:37:13,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:13,965 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-25 15:37:13,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:37:13,966 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-25 15:37:13,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:13,966 INFO L225 Difference]: With dead ends: 30 [2019-02-25 15:37:13,967 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:37:13,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:37:13,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:37:13,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-25 15:37:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:37:13,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-25 15:37:13,972 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-25 15:37:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:13,972 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-25 15:37:13,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:37:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-25 15:37:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:37:13,973 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:13,973 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-25 15:37:13,973 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-25 15:37:13,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:13,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:13,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:14,570 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-25 15:37:14,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:14,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:14,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:14,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:14,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:14,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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:14,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:14,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:14,608 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:14,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:14,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:37:14,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:14,615 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-25 15:37:14,616 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:15,707 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-25 15:37:15,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:15,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:37:15,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:15,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:37:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:37:15,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:37:15,728 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-25 15:37:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:15,785 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-25 15:37:15,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:37:15,785 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-25 15:37:15,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:15,786 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:37:15,786 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:37:15,788 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-25 15:37:15,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:37:15,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:37:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:37:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-25 15:37:15,792 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-25 15:37:15,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:15,792 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-25 15:37:15,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:37:15,792 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-25 15:37:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:37:15,793 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:15,793 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-25 15:37:15,793 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:15,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:15,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-25 15:37:15,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:15,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:15,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:15,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:15,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:16,337 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-25 15:37:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:16,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:16,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:16,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:16,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:16,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:16,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:16,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:16,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:37:16,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:16,385 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-25 15:37:16,385 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:19,062 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-25 15:37:19,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:19,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:37:19,082 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:19,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:37:19,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:37:19,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:19,083 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-25 15:37:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:19,147 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-25 15:37:19,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:37:19,148 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-25 15:37:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:19,149 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:37:19,149 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:37:19,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:37:19,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:37:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-25 15:37:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:37:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-25 15:37:19,153 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-25 15:37:19,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:19,153 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-25 15:37:19,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:37:19,153 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-25 15:37:19,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-25 15:37:19,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:19,154 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-25 15:37:19,154 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:19,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:19,154 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-25 15:37:19,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:19,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:19,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:19,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:20,101 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-25 15:37:20,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:20,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:20,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:20,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:20,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:20,103 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:20,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:20,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:20,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:37:20,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:20,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:37:20,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:20,172 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-25 15:37:20,173 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:21,553 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-25 15:37:21,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:21,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-25 15:37:21,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:21,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:37:21,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:37:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:21,575 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-25 15:37:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:21,800 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-25 15:37:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:37:21,800 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-25 15:37:21,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:21,801 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:37:21,801 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:37:21,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:37:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:37:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:37:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:37:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-25 15:37:21,806 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-25 15:37:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:21,806 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-25 15:37:21,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:37:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-25 15:37:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:37:21,807 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:21,807 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-25 15:37:21,807 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-25 15:37:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:21,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:21,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:21,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:21,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:22,686 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-25 15:37:22,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:22,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:22,686 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:22,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:22,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:22,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:22,700 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:22,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:22,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:22,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:22,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:37:22,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:22,741 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-25 15:37:22,741 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:24,380 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-25 15:37:24,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:24,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:37:24,399 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:24,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:37:24,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:37:24,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:24,401 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-25 15:37:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:24,437 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-25 15:37:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:37:24,437 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-25 15:37:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:24,438 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:37:24,438 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:37:24,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:37:24,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:37:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-25 15:37:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:37:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-25 15:37:24,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-25 15:37:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:24,443 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-25 15:37:24,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:37:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-25 15:37:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-25 15:37:24,444 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:24,444 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-25 15:37:24,444 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:24,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-25 15:37:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:24,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:24,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:25,037 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-25 15:37:25,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:25,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:25,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:25,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:25,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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:25,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:25,051 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:25,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:37:25,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:25,089 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-25 15:37:25,090 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:26,661 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-25 15:37:26,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:37:26,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:26,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:37:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:37:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:26,682 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-25 15:37:26,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:26,764 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-25 15:37:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:37:26,765 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-25 15:37:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:26,765 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:37:26,765 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:37:26,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:37:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:37:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:37:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:37:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-25 15:37:26,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-25 15:37:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:26,770 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-25 15:37:26,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:37:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-25 15:37:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:37:26,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:26,771 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-25 15:37:26,771 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-25 15:37:26,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:26,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:27,440 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-25 15:37:27,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:27,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:27,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:27,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:27,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:27,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:27,450 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:27,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:27,515 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:37:27,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:27,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:37:27,519 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:27,527 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-25 15:37:27,527 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:29,318 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-25 15:37:29,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:29,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-25 15:37:29,339 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:29,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:37:29,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:37:29,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:29,340 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-25 15:37:29,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:29,402 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-25 15:37:29,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:37:29,403 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-25 15:37:29,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:29,404 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:37:29,404 INFO L226 Difference]: Without dead ends: 34 [2019-02-25 15:37:29,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:37:29,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-25 15:37:29,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-25 15:37:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:37:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-25 15:37:29,408 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-25 15:37:29,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:29,408 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-25 15:37:29,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:37:29,408 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-25 15:37:29,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-25 15:37:29,409 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:29,409 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-25 15:37:29,409 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-25 15:37:29,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:29,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:29,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:29,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:30,070 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-25 15:37:30,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:30,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:30,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:30,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:30,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:30,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:30,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:30,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:30,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:30,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:30,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:37:30,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:30,132 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-25 15:37:30,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:31,799 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-25 15:37:31,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:31,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:37:31,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:31,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:37:31,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:37:31,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:31,821 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-25 15:37:31,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:31,905 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-25 15:37:31,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:37:31,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-25 15:37:31,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:31,907 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:37:31,907 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:37:31,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:37:31,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:37:31,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:37:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:37:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-25 15:37:31,910 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-25 15:37:31,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:31,910 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-25 15:37:31,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:37:31,910 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-25 15:37:31,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:37:31,910 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:31,910 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-25 15:37:31,911 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:31,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:31,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-25 15:37:31,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:31,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:31,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:31,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:32,577 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-25 15:37:32,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:32,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:32,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:32,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:32,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:32,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:32,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:32,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:32,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:37:32,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:32,630 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-25 15:37:32,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:34,705 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-25 15:37:34,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:34,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:37:34,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:34,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:37:34,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:37:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:34,726 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-25 15:37:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:34,803 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-25 15:37:34,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:37:34,803 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-25 15:37:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:34,804 INFO L225 Difference]: With dead ends: 38 [2019-02-25 15:37:34,804 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:37:34,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:37:34,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:37:34,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-25 15:37:34,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:37:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-25 15:37:34,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-25 15:37:34,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:34,808 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-25 15:37:34,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:37:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-25 15:37:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-25 15:37:34,809 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:34,809 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-25 15:37:34,809 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:34,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-25 15:37:34,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:34,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:34,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:34,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:34,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:35,672 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-25 15:37:35,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:35,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:35,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:35,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:35,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:35,673 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:35,683 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:35,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:35,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:37:35,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:35,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:37:35,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:35,772 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-25 15:37:35,772 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:37,687 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-25 15:37:37,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:37,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:37:37,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:37,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:37:37,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:37:37,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:37,707 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-25 15:37:37,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:37,782 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:37:37,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:37:37,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-25 15:37:37,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:37,783 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:37:37,783 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:37:37,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:37:37,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:37:37,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:37:37,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:37:37,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:37:37,787 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-25 15:37:37,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:37,788 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:37:37,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:37:37,788 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:37:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:37:37,788 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:37,788 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-25 15:37:37,789 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-25 15:37:37,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:37,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:37,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:37,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:38,670 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-25 15:37:38,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:38,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:38,671 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:38,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:38,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:38,671 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:38,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:38,681 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:38,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:38,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:38,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:37:38,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:38,738 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-25 15:37:38,738 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:40,808 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-25 15:37:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:40,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:37:40,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:40,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:37:40,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:37:40,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:40,829 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-25 15:37:40,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:40,933 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-25 15:37:40,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:37:40,933 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-25 15:37:40,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:40,934 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:37:40,934 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:37:40,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:37:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:37:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-25 15:37:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:37:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-25 15:37:40,936 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-25 15:37:40,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:40,936 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-25 15:37:40,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:37:40,936 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-25 15:37:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-25 15:37:40,938 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:40,938 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-25 15:37:40,938 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-25 15:37:40,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:40,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:40,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:40,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:43,068 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-25 15:37:43,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:43,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:43,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:43,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:43,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:43,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:43,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:43,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:43,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:37:43,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:43,131 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-25 15:37:43,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:45,544 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-25 15:37:45,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:45,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:37:45,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:45,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:37:45,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:37:45,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:45,564 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-25 15:37:45,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:45,639 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-25 15:37:45,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:37:45,640 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-25 15:37:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:45,640 INFO L225 Difference]: With dead ends: 41 [2019-02-25 15:37:45,641 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:37:45,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:37:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:37:45,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:37:45,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:37:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-25 15:37:45,645 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-25 15:37:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:45,645 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-25 15:37:45,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:37:45,645 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-25 15:37:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:37:45,645 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:45,646 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-25 15:37:45,646 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:45,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:45,646 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-25 15:37:45,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:45,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:45,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:45,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:46,607 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-25 15:37:46,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:46,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:46,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:46,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:46,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:46,609 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:46,618 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:46,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:46,746 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:37:46,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:46,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:37:46,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:46,766 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-25 15:37:46,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:49,337 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-25 15:37:49,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:49,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:37:49,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:49,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:37:49,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:37:49,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:49,358 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-25 15:37:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:49,413 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-25 15:37:49,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:37:49,414 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-25 15:37:49,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:49,415 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:37:49,415 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:37:49,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:37:49,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:37:49,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-25 15:37:49,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:37:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-25 15:37:49,419 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-25 15:37:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:49,419 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-25 15:37:49,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:37:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-25 15:37:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-25 15:37:49,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:49,419 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-25 15:37:49,420 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:49,420 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-25 15:37:49,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:49,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:49,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:49,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:49,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:50,607 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-25 15:37:50,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:50,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:50,608 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:50,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:50,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:50,608 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:50,617 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:37:50,617 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:37:50,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:37:50,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:50,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:37:50,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:50,665 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-25 15:37:50,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:53,078 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-25 15:37:53,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:53,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:37:53,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:53,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:37:53,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:37:53,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:53,101 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-25 15:37:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:53,164 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-25 15:37:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:37:53,165 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-25 15:37:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:53,165 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:37:53,165 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:37:53,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:37:53,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:37:53,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:37:53,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:37:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-25 15:37:53,169 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-25 15:37:53,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:53,169 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-25 15:37:53,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:37:53,169 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-25 15:37:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:37:53,169 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:53,170 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-25 15:37:53,170 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:53,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-25 15:37:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:53,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:37:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:53,171 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:53,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:54,318 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-25 15:37:54,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:54,319 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:54,319 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:54,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:54,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:54,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:54,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:54,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:37:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:54,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:37:54,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:54,377 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-25 15:37:54,377 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:37:56,895 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-25 15:37:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:37:56,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:37:56,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:37:56,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:37:56,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:37:56,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:56,915 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-25 15:37:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:37:57,023 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-25 15:37:57,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:37:57,024 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-25 15:37:57,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:37:57,024 INFO L225 Difference]: With dead ends: 44 [2019-02-25 15:37:57,024 INFO L226 Difference]: Without dead ends: 42 [2019-02-25 15:37:57,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:37:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-25 15:37:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-25 15:37:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:37:57,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-25 15:37:57,027 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-25 15:37:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:37:57,027 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-25 15:37:57,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:37:57,027 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-25 15:37:57,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-25 15:37:57,028 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:37:57,028 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-25 15:37:57,028 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:37:57,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:37:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-25 15:37:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:37:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:57,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:37:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:37:57,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:37:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:37:57,992 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-25 15:37:57,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:57,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:37:57,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:37:57,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:37:57,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:37:57,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:37:58,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:37:58,002 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:37:58,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:37:58,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:37:58,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:37:58,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:37:58,131 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-25 15:37:58,131 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:01,159 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-25 15:38:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:01,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:38:01,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:01,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:38:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:38:01,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:38:01,181 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-25 15:38:01,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:01,258 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-25 15:38:01,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:38:01,258 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-25 15:38:01,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:01,259 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:38:01,259 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:38:01,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:38:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:38:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:38:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:38:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-25 15:38:01,262 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-25 15:38:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:01,262 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-25 15:38:01,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:38:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-25 15:38:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:38:01,263 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:01,263 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-25 15:38:01,263 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:01,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-25 15:38:01,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:01,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:01,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:01,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:02,366 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-25 15:38:02,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:02,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:02,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:02,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:02,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:02,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:02,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:02,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:02,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:02,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:02,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:38:02,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:02,428 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-25 15:38:02,428 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:05,555 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-25 15:38:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:38:05,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:05,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:38:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:38:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:38:05,575 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-25 15:38:05,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:05,653 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-25 15:38:05,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:38:05,653 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-25 15:38:05,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:05,654 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:38:05,654 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:38:05,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:38:05,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:38:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-25 15:38:05,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-25 15:38:05,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-25 15:38:05,656 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-25 15:38:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:05,656 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-25 15:38:05,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:38:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-25 15:38:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-25 15:38:05,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:05,657 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-25 15:38:05,657 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:05,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:05,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-25 15:38:05,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:05,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:05,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:05,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:06,692 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-25 15:38:06,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:06,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:06,692 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:06,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:06,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:06,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:06,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:06,702 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:06,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:38:06,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:06,754 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-25 15:38:06,754 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:09,916 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-25 15:38:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:09,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:38:09,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:09,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:38:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:38:09,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:38:09,936 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-25 15:38:10,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:10,047 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-25 15:38:10,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:38:10,048 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-25 15:38:10,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:10,049 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:38:10,049 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:38:10,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:38:10,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:38:10,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:38:10,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:38:10,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-25 15:38:10,052 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-25 15:38:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:10,052 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-25 15:38:10,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:38:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-25 15:38:10,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:38:10,052 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:10,052 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-25 15:38:10,053 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:10,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:10,053 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-25 15:38:10,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:10,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:10,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:10,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:11,221 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-25 15:38:11,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:11,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:11,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:11,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:11,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:11,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:11,230 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:11,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:11,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:38:11,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:11,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:38:11,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:11,395 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-25 15:38:11,395 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:14,609 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-25 15:38:14,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:14,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:38:14,629 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:14,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:38:14,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:38:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:38:14,630 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-25 15:38:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:14,712 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-25 15:38:14,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:38:14,712 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-25 15:38:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:14,713 INFO L225 Difference]: With dead ends: 48 [2019-02-25 15:38:14,713 INFO L226 Difference]: Without dead ends: 46 [2019-02-25 15:38:14,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:38:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-25 15:38:14,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-25 15:38:14,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:38:14,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-25 15:38:14,716 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-25 15:38:14,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:14,716 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-25 15:38:14,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:38:14,716 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-25 15:38:14,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-25 15:38:14,717 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:14,717 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-25 15:38:14,717 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:14,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:14,717 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-25 15:38:14,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:14,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:14,718 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:14,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:14,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:15,904 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-25 15:38:15,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:15,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:15,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:15,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:15,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:15,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:15,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:15,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:15,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:15,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:15,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:38:15,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:15,971 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-25 15:38:15,971 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:19,223 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-25 15:38:19,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:19,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:38:19,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:19,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:38:19,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:38:19,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:38:19,244 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-25 15:38:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:19,302 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-25 15:38:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:38:19,302 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-25 15:38:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:19,303 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:38:19,303 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:38:19,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:38:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:38:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:38:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:38:19,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-25 15:38:19,306 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-25 15:38:19,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:19,307 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-25 15:38:19,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:38:19,307 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-25 15:38:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:38:19,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:19,307 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-25 15:38:19,307 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-25 15:38:19,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:19,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:19,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:19,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:19,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:20,782 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-25 15:38:20,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:20,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:20,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:20,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:20,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:20,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:20,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:20,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:20,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:38:20,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:20,849 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-25 15:38:20,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:24,236 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-25 15:38:24,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:24,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:38:24,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:24,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:38:24,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:38:24,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:38:24,257 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-25 15:38:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:24,371 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-25 15:38:24,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:38:24,372 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-25 15:38:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:24,372 INFO L225 Difference]: With dead ends: 50 [2019-02-25 15:38:24,372 INFO L226 Difference]: Without dead ends: 48 [2019-02-25 15:38:24,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:38:24,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-25 15:38:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-25 15:38:24,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:38:24,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-25 15:38:24,375 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-25 15:38:24,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:24,375 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-25 15:38:24,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:38:24,375 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-25 15:38:24,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-25 15:38:24,375 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:24,375 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-25 15:38:24,376 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:24,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:24,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-25 15:38:24,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:24,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:24,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:24,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:25,822 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-25 15:38:25,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:25,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:25,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:25,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:25,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:25,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:25,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:25,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:25,990 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:38:25,990 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:25,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:38:25,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:26,002 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-25 15:38:26,002 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:29,504 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-25 15:38:29,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:29,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-25 15:38:29,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:29,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:38:29,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:38:29,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:29,525 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-25 15:38:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:29,627 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:38:29,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:38:29,628 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-25 15:38:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:29,628 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:38:29,629 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:38:29,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:38:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:38:29,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:38:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:38:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:38:29,632 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-25 15:38:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:29,632 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:38:29,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:38:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:38:29,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:38:29,633 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:29,633 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-25 15:38:29,633 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:29,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:29,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-25 15:38:29,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:29,635 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:29,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:29,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:31,237 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-25 15:38:31,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:31,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:31,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:31,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:31,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:31,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:31,249 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:31,249 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:31,296 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:31,296 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:31,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:38:31,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:31,310 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-25 15:38:31,310 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:35,199 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-25 15:38:35,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:35,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:38:35,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:35,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:38:35,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:38:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:35,221 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-25 15:38:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:35,480 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-25 15:38:35,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:38:35,481 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-25 15:38:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:35,481 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:38:35,481 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:38:35,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:38:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:38:35,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-25 15:38:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-25 15:38:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-25 15:38:35,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-25 15:38:35,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:35,484 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-25 15:38:35,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:38:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-25 15:38:35,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-25 15:38:35,485 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:35,485 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-25 15:38:35,485 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:35,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-25 15:38:35,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:35,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:35,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:35,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:37,023 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-25 15:38:37,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:37,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:37,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:37,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:37,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:37,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:37,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:37,034 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:37,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:38:37,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:37,093 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-25 15:38:37,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:41,155 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-25 15:38:41,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:41,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:38:41,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:41,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:38:41,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:38:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:41,177 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-25 15:38:41,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:41,274 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-25 15:38:41,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:38:41,275 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-25 15:38:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:41,276 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:38:41,276 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:38:41,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:38:41,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:38:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:38:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:38:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-25 15:38:41,278 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-25 15:38:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:41,279 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-25 15:38:41,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:38:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-25 15:38:41,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:38:41,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:41,279 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-25 15:38:41,280 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:41,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:41,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-25 15:38:41,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:41,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:41,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:41,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:41,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:42,968 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-25 15:38:42,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:42,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:42,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:42,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:42,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:42,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:42,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:38:42,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:38:43,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:38:43,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:43,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:38:43,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:43,182 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-25 15:38:43,182 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:47,688 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-25 15:38:47,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:47,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:38:47,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:47,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:38:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:38:47,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:47,710 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-25 15:38:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:47,776 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-25 15:38:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:38:47,776 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-25 15:38:47,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:47,777 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:38:47,777 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:38:47,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:38:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:38:47,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-25 15:38:47,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:38:47,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-25 15:38:47,781 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-25 15:38:47,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:47,781 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-25 15:38:47,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:38:47,781 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-25 15:38:47,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:38:47,782 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:47,782 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-25 15:38:47,782 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:47,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:47,782 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-25 15:38:47,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:47,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:47,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:47,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:47,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:49,343 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-25 15:38:49,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:49,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:49,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:49,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:49,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:49,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:49,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:38:49,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:38:49,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:38:49,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:38:49,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:38:49,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:49,416 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-25 15:38:49,416 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:38:53,843 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-25 15:38:53,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:38:53,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:38:53,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:38:53,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:38:53,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:38:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:53,875 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-25 15:38:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:38:54,023 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-25 15:38:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:38:54,023 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-25 15:38:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:38:54,024 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:38:54,024 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:38:54,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:38:54,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:38:54,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:38:54,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:38:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-25 15:38:54,027 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-25 15:38:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:38:54,027 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-25 15:38:54,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:38:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-25 15:38:54,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:38:54,027 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:38:54,027 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-25 15:38:54,027 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:38:54,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:38:54,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-25 15:38:54,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:38:54,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:54,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:38:54,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:38:54,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:38:54,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:55,597 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-25 15:38:55,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:55,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:38:55,598 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:38:55,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:38:55,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:38:55,598 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:38:55,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:38:55,607 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:38:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:38:55,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:38:55,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:38:55,669 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-25 15:38:55,669 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:00,014 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-25 15:39:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:00,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:39:00,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:39:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:39:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:39:00,034 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-25 15:39:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:00,102 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-25 15:39:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:39:00,102 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-25 15:39:00,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:00,103 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:39:00,103 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:39:00,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:39:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:39:00,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-25 15:39:00,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-25 15:39:00,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-25 15:39:00,107 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-25 15:39:00,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:00,107 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-25 15:39:00,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:39:00,107 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-25 15:39:00,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-25 15:39:00,107 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:00,108 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-25 15:39:00,108 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:00,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:00,108 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-25 15:39:00,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:00,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:00,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:00,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:00,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:01,939 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-25 15:39:01,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:01,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:01,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:01,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:01,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:01,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:01,949 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:01,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:02,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:39:02,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:02,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:39:02,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:02,195 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-25 15:39:02,195 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:07,037 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-25 15:39:07,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:07,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:39:07,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:07,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:39:07,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:39:07,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:39:07,070 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-25 15:39:07,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:07,233 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-25 15:39:07,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:39:07,234 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-25 15:39:07,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:07,234 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:39:07,234 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:39:07,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:39:07,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:39:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:39:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:39:07,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-25 15:39:07,237 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-25 15:39:07,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:07,238 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-25 15:39:07,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:39:07,238 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-25 15:39:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:39:07,238 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:07,238 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-25 15:39:07,239 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:07,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:07,239 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-25 15:39:07,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:07,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:07,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:07,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:07,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:09,287 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-25 15:39:09,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:09,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:09,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:09,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:09,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:09,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:09,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:09,352 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:09,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:09,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:39:09,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:09,363 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-25 15:39:09,363 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:14,382 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-25 15:39:14,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:14,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:39:14,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:14,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:39:14,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:39:14,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:39:14,404 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-25 15:39:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:14,509 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-25 15:39:14,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:39:14,510 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-25 15:39:14,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:14,510 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:39:14,510 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:39:14,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:39:14,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:39:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-25 15:39:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:39:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-25 15:39:14,513 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-25 15:39:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:14,513 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-25 15:39:14,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:39:14,514 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-25 15:39:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-25 15:39:14,514 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:14,514 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-25 15:39:14,514 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:14,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:14,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-25 15:39:14,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:14,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:14,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:14,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:16,547 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-25 15:39:16,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:16,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:16,548 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:16,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:16,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:16,548 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:16,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:16,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:16,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:39:16,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:16,623 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-25 15:39:16,623 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:21,725 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-25 15:39:21,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:21,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:39:21,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:21,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:39:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:39:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:39:21,745 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-25 15:39:21,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:21,854 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-25 15:39:21,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:39:21,854 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-25 15:39:21,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:21,855 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:39:21,855 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:39:21,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:39:21,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:39:21,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:39:21,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:39:21,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-25 15:39:21,859 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-25 15:39:21,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:21,859 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-25 15:39:21,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:39:21,859 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-25 15:39:21,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:39:21,860 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:21,860 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-25 15:39:21,860 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:21,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:21,860 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-25 15:39:21,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:21,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:21,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:21,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:23,615 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-25 15:39:23,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:23,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:23,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:23,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:23,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:23,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:23,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:23,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:23,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:39:23,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:23,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:39:23,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:23,902 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-25 15:39:23,902 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:29,216 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-25 15:39:29,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:29,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-25 15:39:29,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:29,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:39:29,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:39:29,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:39:29,238 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-25 15:39:29,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:29,314 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-25 15:39:29,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:39:29,315 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-25 15:39:29,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:29,316 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:39:29,316 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:39:29,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:39:29,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:39:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-25 15:39:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:39:29,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-25 15:39:29,319 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-25 15:39:29,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:29,319 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-25 15:39:29,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:39:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-25 15:39:29,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-25 15:39:29,320 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:29,320 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-25 15:39:29,320 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:29,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-25 15:39:29,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:29,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:29,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:29,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:31,724 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-25 15:39:31,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:31,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:31,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:31,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:31,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:31,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:31,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:31,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:31,793 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:31,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:31,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-25 15:39:31,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:31,805 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-25 15:39:31,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:37,196 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-25 15:39:37,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:37,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-25 15:39:37,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:37,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-25 15:39:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-25 15:39:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:39:37,217 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-25 15:39:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:37,320 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-25 15:39:37,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:39:37,321 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-25 15:39:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:37,321 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:39:37,321 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:39:37,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:39:37,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:39:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:39:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:39:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-25 15:39:37,323 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-25 15:39:37,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:37,324 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-25 15:39:37,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-25 15:39:37,324 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-25 15:39:37,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:39:37,324 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:37,324 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-25 15:39:37,324 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:37,325 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-25 15:39:37,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:37,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:37,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:37,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:37,326 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:40,028 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-25 15:39:40,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:40,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:40,029 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:40,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:40,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:40,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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:40,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:39:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:40,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-25 15:39:40,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:40,107 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-25 15:39:40,107 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:45,739 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-25 15:39:45,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:45,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-25 15:39:45,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:45,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:39:45,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:39:45,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:39:45,759 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-25 15:39:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:45,882 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-25 15:39:45,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:39:45,882 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-25 15:39:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:45,883 INFO L225 Difference]: With dead ends: 62 [2019-02-25 15:39:45,883 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:39:45,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:39:45,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:39:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-25 15:39:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-25 15:39:45,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-25 15:39:45,886 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-25 15:39:45,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:45,886 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-25 15:39:45,886 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:39:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-25 15:39:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-25 15:39:45,887 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:45,887 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-25 15:39:45,887 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:45,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-25 15:39:45,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:45,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:45,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:39:45,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:45,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:48,042 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-25 15:39:48,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:48,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:48,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:48,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:48,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:48,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:48,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:39:48,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:39:48,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:39:48,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:48,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:39:48,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:48,349 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-25 15:39:48,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:39:54,270 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-25 15:39:54,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:39:54,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-25 15:39:54,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:39:54,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:39:54,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:39:54,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:39:54,292 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-25 15:39:54,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:39:54,377 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:39:54,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:39:54,378 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-25 15:39:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:39:54,379 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:39:54,379 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:39:54,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:39:54,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:39:54,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:39:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:39:54,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:39:54,383 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-25 15:39:54,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:39:54,383 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:39:54,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:39:54,383 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:39:54,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:39:54,384 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:39:54,384 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-25 15:39:54,384 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:39:54,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:39:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-25 15:39:54,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:39:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:54,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:39:54,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:39:54,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:39:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:39:56,513 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-25 15:39:56,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:56,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:39:56,514 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:39:56,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:39:56,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:39:56,514 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:39:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:39:56,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:39:56,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:39:56,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:39:56,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:39:56,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:39:56,608 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-25 15:39:56,608 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:03,035 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-25 15:40:03,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:03,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-25 15:40:03,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:03,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:40:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:40:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:40:03,056 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-25 15:40:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:03,182 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-25 15:40:03,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:40:03,182 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-25 15:40:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:03,183 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:40:03,183 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:40:03,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:40:03,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:40:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-25 15:40:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-25 15:40:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-25 15:40:03,186 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-25 15:40:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:03,186 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-25 15:40:03,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:40:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-25 15:40:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-25 15:40:03,187 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:03,187 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-25 15:40:03,187 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:03,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:03,188 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-25 15:40:03,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:03,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:03,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:03,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:05,242 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-25 15:40:05,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:05,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:05,243 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:05,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:05,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:05,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:40:05,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:05,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:05,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:40:05,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:05,331 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-25 15:40:05,331 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:11,642 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-25 15:40:11,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:11,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-25 15:40:11,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:11,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-25 15:40:11,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-25 15:40:11,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:40:11,662 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-25 15:40:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:11,777 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-25 15:40:11,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:40:11,777 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-25 15:40:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:11,778 INFO L225 Difference]: With dead ends: 65 [2019-02-25 15:40:11,778 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:40:11,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:40:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:40:11,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:40:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:40:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-25 15:40:11,782 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-25 15:40:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:11,782 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-25 15:40:11,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-25 15:40:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-25 15:40:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:40:11,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:11,783 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-25 15:40:11,783 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:11,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:11,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-25 15:40:11,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:11,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:11,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:11,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:14,336 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-25 15:40:14,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:14,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:14,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:14,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:14,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:14,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:40:14,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:14,346 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:14,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-25 15:40:14,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:14,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:40:14,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:14,722 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-25 15:40:14,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:21,160 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-25 15:40:21,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:21,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-25 15:40:21,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:21,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:40:21,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:40:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:40:21,190 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-25 15:40:21,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:21,294 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-25 15:40:21,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:40:21,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-25 15:40:21,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:21,295 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:40:21,295 INFO L226 Difference]: Without dead ends: 64 [2019-02-25 15:40:21,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:40:21,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-25 15:40:21,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-25 15:40:21,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:40:21,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-25 15:40:21,297 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-25 15:40:21,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:21,297 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-25 15:40:21,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:40:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-25 15:40:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-25 15:40:21,298 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:21,298 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-25 15:40:21,298 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:21,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:21,298 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-25 15:40:21,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:21,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:21,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:21,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:21,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:23,847 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-25 15:40:23,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:23,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:23,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:23,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:23,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:23,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:40:23,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:23,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:23,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:23,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:40:23,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:23,931 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-25 15:40:23,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:30,550 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-25 15:40:30,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:30,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-25 15:40:30,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:30,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-25 15:40:30,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-25 15:40:30,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:40:30,571 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-25 15:40:30,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:30,714 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-25 15:40:30,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:40:30,714 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-25 15:40:30,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:30,714 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:40:30,714 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:40:30,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:40:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:40:30,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:40:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:40:30,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-25 15:40:30,718 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-25 15:40:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:30,718 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-25 15:40:30,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-25 15:40:30,718 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-25 15:40:30,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:40:30,718 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:30,718 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-25 15:40:30,719 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:30,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:30,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-25 15:40:30,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:30,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:30,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:30,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:33,248 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-25 15:40:33,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:33,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:33,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:33,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:33,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:33,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:40:33,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:33,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:40:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:33,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:40:33,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:33,346 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-25 15:40:33,346 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:40,357 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-25 15:40:40,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:40,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-25 15:40:40,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:40,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:40:40,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:40:40,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:40:40,378 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-25 15:40:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:40,524 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-25 15:40:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:40:40,525 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-25 15:40:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:40,525 INFO L225 Difference]: With dead ends: 68 [2019-02-25 15:40:40,525 INFO L226 Difference]: Without dead ends: 66 [2019-02-25 15:40:40,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:40:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-25 15:40:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-25 15:40:40,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:40:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-25 15:40:40,529 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-25 15:40:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:40,529 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-25 15:40:40,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:40:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-25 15:40:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-25 15:40:40,529 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:40,530 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-25 15:40:40,530 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-25 15:40:40,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:40,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:40:40,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:40,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:42,969 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-25 15:40:42,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:42,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:42,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:42,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:42,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:42,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:40:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:40:42,978 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:40:43,353 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:40:43,353 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:43,356 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:40:43,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:43,366 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-25 15:40:43,366 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:40:50,308 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-25 15:40:50,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:40:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-25 15:40:50,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:40:50,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:40:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:40:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:40:50,331 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-25 15:40:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:40:50,456 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-25 15:40:50,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:40:50,457 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-25 15:40:50,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:40:50,457 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:40:50,457 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:40:50,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:40:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:40:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:40:50,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:40:50,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-25 15:40:50,461 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-25 15:40:50,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:40:50,461 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-25 15:40:50,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:40:50,462 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-25 15:40:50,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:40:50,462 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:40:50,462 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-25 15:40:50,462 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:40:50,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:40:50,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-25 15:40:50,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:40:50,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:50,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:40:50,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:40:50,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:40:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:40:52,902 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-25 15:40:52,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:52,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:40:52,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:40:52,903 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:40:52,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:40:52,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:40:52,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:40:52,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:40:52,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:40:52,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:40:52,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-25 15:40:52,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:40:52,996 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-25 15:40:52,996 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:00,588 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-25 15:41:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:00,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-25 15:41:00,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:00,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:41:00,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:41:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:41:00,608 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-25 15:41:00,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:00,738 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-25 15:41:00,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:41:00,742 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-25 15:41:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:00,743 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:41:00,743 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:41:00,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:41:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:41:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-25 15:41:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:41:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-25 15:41:00,749 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-25 15:41:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:00,749 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-25 15:41:00,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:41:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-25 15:41:00,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-25 15:41:00,750 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:00,750 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-25 15:41:00,750 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-25 15:41:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:00,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:00,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:00,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:03,230 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-25 15:41:03,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:03,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:03,231 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:03,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:03,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:03,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:41:03,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:03,240 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:03,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-25 15:41:03,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:03,348 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-25 15:41:03,349 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:11,159 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-25 15:41:11,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:11,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-25 15:41:11,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:11,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-25 15:41:11,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-25 15:41:11,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:41:11,179 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-25 15:41:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:11,266 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-25 15:41:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:41:11,266 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-25 15:41:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:11,267 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:41:11,267 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:41:11,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:41:11,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:41:11,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:41:11,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:41:11,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-25 15:41:11,271 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-25 15:41:11,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:11,271 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-25 15:41:11,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-25 15:41:11,272 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-25 15:41:11,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:41:11,272 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:11,272 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-25 15:41:11,273 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:11,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:11,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-25 15:41:11,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:11,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:11,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:11,274 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:14,057 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-25 15:41:14,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:14,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:14,058 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:14,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:14,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:14,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:41:14,066 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:14,066 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:14,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:41:14,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:14,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:41:14,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:14,537 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-25 15:41:14,537 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:22,267 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-25 15:41:22,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:22,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-25 15:41:22,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:22,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:41:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:41:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:41:22,289 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-25 15:41:22,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:22,400 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-25 15:41:22,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:41:22,401 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-25 15:41:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:22,402 INFO L225 Difference]: With dead ends: 72 [2019-02-25 15:41:22,402 INFO L226 Difference]: Without dead ends: 70 [2019-02-25 15:41:22,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:41:22,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-25 15:41:22,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-25 15:41:22,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:41:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-25 15:41:22,406 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-25 15:41:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-25 15:41:22,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:41:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-25 15:41:22,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:41:22,407 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:22,407 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-25 15:41:22,408 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:22,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:22,408 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-25 15:41:22,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:22,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:22,409 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:25,883 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-25 15:41:25,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:25,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:25,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:25,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:25,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:25,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:41:25,894 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:41:25,894 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:41:25,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:41:25,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:25,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:41:25,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:25,986 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-25 15:41:25,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:35,789 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-25 15:41:35,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:35,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-25 15:41:35,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:35,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-25 15:41:35,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-25 15:41:35,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:41:35,810 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-25 15:41:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:36,149 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-25 15:41:36,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:41:36,150 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-25 15:41:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:36,150 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:41:36,150 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:41:36,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:41:36,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:41:36,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:41:36,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:41:36,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-25 15:41:36,154 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-25 15:41:36,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:36,154 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-25 15:41:36,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-25 15:41:36,154 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-25 15:41:36,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:41:36,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:36,154 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-25 15:41:36,155 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:36,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:36,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-25 15:41:36,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:36,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:41:36,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:36,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:36,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:38,970 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-25 15:41:38,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:38,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:38,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:38,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:38,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:38,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:41:38,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:38,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:41:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:39,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-25 15:41:39,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:39,064 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-25 15:41:39,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:41:47,805 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-25 15:41:47,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:41:47,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-25 15:41:47,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:41:47,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:41:47,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:41:47,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:41:47,825 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-25 15:41:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:41:47,923 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-25 15:41:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:41:47,923 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-25 15:41:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:41:47,924 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:41:47,924 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:41:47,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:41:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:41:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-25 15:41:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-25 15:41:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-25 15:41:47,928 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-25 15:41:47,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:41:47,928 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-25 15:41:47,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:41:47,928 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-25 15:41:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-25 15:41:47,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:41:47,928 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-25 15:41:47,929 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:41:47,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:41:47,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-25 15:41:47,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:41:47,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:47,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:41:47,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:41:47,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:41:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:41:50,835 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-25 15:41:50,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:50,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:41:50,836 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:41:50,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:41:50,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:41:50,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:41:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:41:50,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:41:51,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-25 15:41:51,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:41:51,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:41:51,350 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:41:51,361 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-25 15:41:51,361 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:00,293 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-25 15:42:00,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:00,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-25 15:42:00,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:00,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:42:00,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:42:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:42:00,316 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-25 15:42:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:00,522 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:42:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:42:00,523 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-25 15:42:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:00,523 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:42:00,523 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:42:00,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:42:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:42:00,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:42:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:42:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:42:00,526 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-25 15:42:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:00,526 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:42:00,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:42:00,526 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:42:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:42:00,527 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:00,527 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-25 15:42:00,527 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-25 15:42:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:00,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:00,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:03,387 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-25 15:42:03,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:03,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:03,388 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:03,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:03,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:03,388 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:03,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:03,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:03,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:03,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:03,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-25 15:42:03,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:03,481 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-25 15:42:03,482 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:42:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:12,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-25 15:42:12,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:42:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:42:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:42:12,458 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-25 15:42:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:12,628 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-25 15:42:12,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:42:12,629 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-25 15:42:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:12,629 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:42:12,629 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:42:12,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:42:12,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:42:12,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-25 15:42:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:42:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-25 15:42:12,634 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-25 15:42:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:12,634 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-25 15:42:12,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:42:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-25 15:42:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-25 15:42:12,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:12,635 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-25 15:42:12,635 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:12,636 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-25 15:42:12,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:12,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:12,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:12,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:12,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:15,870 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-25 15:42:15,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:15,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:15,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:15,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:15,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:15,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:15,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:15,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:15,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:42:15,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:15,963 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-25 15:42:15,963 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:24,943 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-25 15:42:24,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:24,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-25 15:42:24,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:24,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-25 15:42:24,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-25 15:42:24,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:42:24,966 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-25 15:42:25,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:25,139 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-25 15:42:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:42:25,139 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-25 15:42:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:25,140 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:42:25,140 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:42:25,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:42:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:42:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:42:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:42:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-25 15:42:25,145 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-25 15:42:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:25,145 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-25 15:42:25,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-25 15:42:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-25 15:42:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:42:25,145 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:25,146 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-25 15:42:25,146 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:25,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-25 15:42:25,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:25,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:25,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:25,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:25,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:28,362 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-25 15:42:28,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:28,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:28,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:28,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:28,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:28,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:28,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:42:28,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:42:28,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-25 15:42:28,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:29,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:42:29,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:29,020 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-25 15:42:29,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:38,346 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-25 15:42:38,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:38,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-25 15:42:38,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:38,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:42:38,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:42:38,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:42:38,368 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-25 15:42:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:38,529 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-25 15:42:38,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:42:38,530 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-25 15:42:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:38,530 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:42:38,530 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:42:38,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:42:38,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:42:38,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-25 15:42:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-25 15:42:38,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-25 15:42:38,534 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-25 15:42:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:38,534 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-25 15:42:38,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:42:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-25 15:42:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-25 15:42:38,535 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:38,535 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-25 15:42:38,535 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:38,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:38,536 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-25 15:42:38,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:38,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:38,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:38,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:38,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:41,951 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-25 15:42:41,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:41,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:41,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:41,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:41,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:41,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:41,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:42:41,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:42:42,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:42:42,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:42:42,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-25 15:42:42,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:42,059 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-25 15:42:42,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:42:52,079 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-25 15:42:52,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:42:52,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-25 15:42:52,099 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:42:52,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:42:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:42:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:42:52,101 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-25 15:42:52,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:42:52,268 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-25 15:42:52,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:42:52,268 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-25 15:42:52,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:42:52,269 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:42:52,269 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:42:52,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:42:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:42:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:42:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:42:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-25 15:42:52,272 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-25 15:42:52,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:42:52,273 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-25 15:42:52,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:42:52,273 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-25 15:42:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:42:52,273 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:42:52,274 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-25 15:42:52,274 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:42:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:42:52,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-25 15:42:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:42:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:52,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:42:52,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:42:52,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:42:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:55,824 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-25 15:42:55,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:55,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:42:55,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:42:55,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:42:55,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:42:55,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:42:55,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:42:55,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:42:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:42:55,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:42:55,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:42:55,928 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-25 15:42:55,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:05,872 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-25 15:43:05,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:05,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-25 15:43:05,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:05,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:43:05,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:43:05,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:43:05,895 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-25 15:43:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:06,062 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-25 15:43:06,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:43:06,063 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-25 15:43:06,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:06,063 INFO L225 Difference]: With dead ends: 80 [2019-02-25 15:43:06,063 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:43:06,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:43:06,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:43:06,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-25 15:43:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:43:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-25 15:43:06,067 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-25 15:43:06,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:06,067 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-25 15:43:06,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:43:06,067 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-25 15:43:06,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-25 15:43:06,067 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:06,067 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-25 15:43:06,068 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:06,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-25 15:43:06,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:06,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:06,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:06,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:09,641 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-25 15:43:09,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:09,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:09,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:09,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:09,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:09,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:09,650 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:09,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:10,358 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:43:10,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:10,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:43:10,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:10,383 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-25 15:43:10,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:20,657 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-25 15:43:20,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:20,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-25 15:43:20,678 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:20,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:43:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:43:20,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:43:20,680 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-25 15:43:20,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:20,793 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-25 15:43:20,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:43:20,794 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-25 15:43:20,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:20,795 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:43:20,795 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:43:20,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:43:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:43:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:43:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:43:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-25 15:43:20,798 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-25 15:43:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:20,798 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-25 15:43:20,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:43:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-25 15:43:20,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:43:20,799 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:20,799 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-25 15:43:20,799 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-25 15:43:20,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:20,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:20,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:20,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:24,325 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-25 15:43:24,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:24,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:24,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:24,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:24,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:24,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:43:24,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:43:24,411 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:43:24,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:24,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-25 15:43:24,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:24,426 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-25 15:43:24,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:34,895 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-25 15:43:34,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:34,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-25 15:43:34,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:34,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:43:34,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:43:34,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:43:34,916 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-25 15:43:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:35,042 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-25 15:43:35,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:43:35,043 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-25 15:43:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:35,043 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:43:35,044 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:43:35,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:43:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:43:35,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-25 15:43:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:43:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-25 15:43:35,056 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-25 15:43:35,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:35,057 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-25 15:43:35,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:43:35,057 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-25 15:43:35,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-25 15:43:35,057 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:35,057 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-25 15:43:35,057 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-25 15:43:35,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:35,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:43:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:35,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:38,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:38,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:38,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:38,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:38,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:38,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:38,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:38,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:43:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:38,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-25 15:43:38,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:38,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:43:49,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:43:49,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:43:49,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-25 15:43:49,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:43:49,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-25 15:43:49,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-25 15:43:49,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:43:49,536 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-25 15:43:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:43:49,924 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-25 15:43:49,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:43:49,924 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-25 15:43:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:43:49,925 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:43:49,925 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:43:49,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:43:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:43:49,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:43:49,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:43:49,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-25 15:43:49,927 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-25 15:43:49,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:43:49,927 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-25 15:43:49,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-25 15:43:49,928 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-25 15:43:49,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:43:49,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:43:49,928 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-25 15:43:49,928 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:43:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:43:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-25 15:43:49,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:43:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:49,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:43:49,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:43:49,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:43:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:43:53,720 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-25 15:43:53,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:53,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:43:53,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:43:53,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:43:53,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:43:53,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:43:53,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:43:53,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:43:54,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-25 15:43:54,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:43:54,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:43:54,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:43:54,582 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-25 15:43:54,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:05,548 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-25 15:44:05,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:05,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-25 15:44:05,570 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:05,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:44:05,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:44:05,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:44:05,572 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-25 15:44:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:06,201 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-25 15:44:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:44:06,201 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-25 15:44:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:06,202 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:44:06,202 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:44:06,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:44:06,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:44:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-25 15:44:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-25 15:44:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-25 15:44:06,206 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-25 15:44:06,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:06,206 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-25 15:44:06,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:44:06,206 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-25 15:44:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-25 15:44:06,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:06,207 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-25 15:44:06,207 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:06,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:06,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-25 15:44:06,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:06,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:06,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:06,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:10,184 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-25 15:44:10,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:10,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:10,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:10,185 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:10,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:10,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:10,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:44:10,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:44:10,278 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:44:10,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:10,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:44:10,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:10,306 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-25 15:44:10,306 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:21,680 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-25 15:44:21,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:21,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-25 15:44:21,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:21,699 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-25 15:44:21,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-25 15:44:21,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:44:21,701 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-25 15:44:21,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:21,865 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-25 15:44:21,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:44:21,865 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-25 15:44:21,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:21,866 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:44:21,866 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:44:21,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:44:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:44:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:44:21,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:44:21,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-25 15:44:21,869 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-25 15:44:21,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:21,869 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-25 15:44:21,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-25 15:44:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-25 15:44:21,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:44:21,870 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:21,870 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-25 15:44:21,870 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:21,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:21,871 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-25 15:44:21,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:21,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:21,871 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:21,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:21,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:26,073 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-25 15:44:26,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:26,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:26,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:26,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:26,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:26,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:26,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:26,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:44:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:26,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-25 15:44:26,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:26,185 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-25 15:44:26,185 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:37,688 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-25 15:44:37,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:37,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-25 15:44:37,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:37,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:44:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:44:37,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:44:37,710 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-25 15:44:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:37,856 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-25 15:44:37,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:44:37,857 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-25 15:44:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:37,858 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:44:37,858 INFO L226 Difference]: Without dead ends: 84 [2019-02-25 15:44:37,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:44:37,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-25 15:44:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-25 15:44:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:44:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-25 15:44:37,862 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-25 15:44:37,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:37,862 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-25 15:44:37,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:44:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-25 15:44:37,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-25 15:44:37,863 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:37,863 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-25 15:44:37,863 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:37,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:37,864 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-25 15:44:37,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:37,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:37,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:44:37,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:37,865 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:41,975 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-25 15:44:41,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:41,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:41,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:41,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:41,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:41,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:41,983 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:44:41,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:44:42,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-25 15:44:42,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:42,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:44:42,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:42,875 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-25 15:44:42,875 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:44:54,871 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-25 15:44:54,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:44:54,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-25 15:44:54,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:44:54,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:44:54,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:44:54,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:44:54,894 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-25 15:44:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:44:55,105 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:44:55,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:44:55,105 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-25 15:44:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:44:55,106 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:44:55,106 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:44:55,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:44:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:44:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:44:55,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:44:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:44:55,108 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-25 15:44:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:44:55,109 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:44:55,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:44:55,109 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:44:55,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:44:55,109 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:44:55,109 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-25 15:44:55,109 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:44:55,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:44:55,109 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-25 15:44:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:44:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:55,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:44:55,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:44:55,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:44:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:44:59,349 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-25 15:44:59,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:59,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:44:59,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:44:59,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:44:59,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:44:59,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:44:59,358 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:44:59,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:44:59,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:44:59,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:44:59,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:44:59,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:44:59,458 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-25 15:44:59,458 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:11,414 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-25 15:45:11,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:11,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-25 15:45:11,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:11,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:45:11,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:45:11,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:45:11,435 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-25 15:45:11,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:11,623 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-25 15:45:11,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:45:11,623 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-25 15:45:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:11,624 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:45:11,624 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:45:11,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:45:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:45:11,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-25 15:45:11,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-25 15:45:11,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-25 15:45:11,627 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-25 15:45:11,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:11,627 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-25 15:45:11,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:45:11,628 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-25 15:45:11,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-25 15:45:11,628 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:11,628 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-25 15:45:11,628 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:11,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:11,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-25 15:45:11,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:11,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:11,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:11,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:11,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:11,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:15,761 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-25 15:45:15,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:15,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:15,762 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:15,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:15,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:15,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:15,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:15,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:45:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:15,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-25 15:45:15,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:15,880 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-25 15:45:15,880 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:28,360 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-25 15:45:28,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:28,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-25 15:45:28,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:28,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-25 15:45:28,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-25 15:45:28,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:45:28,380 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-25 15:45:28,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:28,630 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-25 15:45:28,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:45:28,631 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-25 15:45:28,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:28,631 INFO L225 Difference]: With dead ends: 89 [2019-02-25 15:45:28,632 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:45:28,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:45:28,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:45:28,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:45:28,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:45:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-25 15:45:28,634 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-25 15:45:28,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:28,635 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-25 15:45:28,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-25 15:45:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-25 15:45:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:45:28,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:28,635 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-25 15:45:28,635 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:28,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-25 15:45:28,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:28,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:28,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:45:28,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:28,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:32,922 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-25 15:45:32,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:32,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:32,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:32,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:32,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:32,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:32,933 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:45:32,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:45:33,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-25 15:45:33,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:33,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:45:33,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:33,983 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-25 15:45:33,983 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:45:46,701 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-25 15:45:46,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:45:46,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-25 15:45:46,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:45:46,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:45:46,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:45:46,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:45:46,724 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-25 15:45:46,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:45:46,876 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-25 15:45:46,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:45:46,877 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-25 15:45:46,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:45:46,877 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:45:46,877 INFO L226 Difference]: Without dead ends: 88 [2019-02-25 15:45:46,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:45:46,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-25 15:45:46,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-25 15:45:46,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-25 15:45:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-25 15:45:46,881 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-25 15:45:46,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:45:46,881 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-25 15:45:46,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:45:46,881 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-25 15:45:46,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-25 15:45:46,882 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:45:46,882 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-25 15:45:46,882 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:45:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:45:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-25 15:45:46,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:45:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:46,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:45:46,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:45:46,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:45:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:45:51,192 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-25 15:45:51,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:51,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:45:51,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:45:51,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:45:51,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:45:51,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:45:51,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:45:51,201 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:45:51,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:45:51,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:45:51,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-25 15:45:51,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:45:51,304 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-25 15:45:51,304 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:04,126 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-25 15:46:04,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:04,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-25 15:46:04,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:04,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-25 15:46:04,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-25 15:46:04,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:46:04,147 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-25 15:46:04,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:04,322 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-25 15:46:04,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:46:04,322 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-25 15:46:04,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:04,323 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:46:04,323 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:46:04,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:46:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:46:04,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:46:04,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:46:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-25 15:46:04,326 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-25 15:46:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:04,326 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-25 15:46:04,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-25 15:46:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-25 15:46:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:46:04,327 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:04,327 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-25 15:46:04,327 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-25 15:46:04,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:04,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:04,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:04,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:04,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:08,977 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-25 15:46:08,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:08,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:08,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:08,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:08,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:08,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:08,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:08,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:46:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:09,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-25 15:46:09,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:09,093 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-25 15:46:09,093 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:22,594 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-25 15:46:22,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:22,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-25 15:46:22,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:22,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:46:22,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:46:22,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:46:22,615 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-25 15:46:22,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:22,923 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-25 15:46:22,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:46:22,924 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-25 15:46:22,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:22,925 INFO L225 Difference]: With dead ends: 92 [2019-02-25 15:46:22,925 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:46:22,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:46:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:46:22,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-25 15:46:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-25 15:46:22,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-25 15:46:22,928 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-25 15:46:22,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:22,929 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-25 15:46:22,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:46:22,929 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-25 15:46:22,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-25 15:46:22,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:22,929 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-25 15:46:22,929 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:22,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:22,930 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-25 15:46:22,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:22,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:46:22,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:22,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:27,429 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-25 15:46:27,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:27,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:27,430 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:27,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:27,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:27,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:27,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:46:27,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:46:28,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-25 15:46:28,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:28,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:46:28,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:28,573 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-25 15:46:28,574 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:46:42,309 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-25 15:46:42,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:46:42,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-25 15:46:42,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:46:42,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:46:42,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:46:42,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:46:42,334 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-25 15:46:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:46:42,568 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-25 15:46:42,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:46:42,568 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-25 15:46:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:46:42,569 INFO L225 Difference]: With dead ends: 93 [2019-02-25 15:46:42,569 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:46:42,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:46:42,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:46:42,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:46:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:46:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-25 15:46:42,572 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-25 15:46:42,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:46:42,572 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-25 15:46:42,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:46:42,572 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-25 15:46:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:46:42,572 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:46:42,572 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-25 15:46:42,572 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:46:42,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:46:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-25 15:46:42,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:46:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:42,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:46:42,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:46:42,573 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:46:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:46:47,216 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-25 15:46:47,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:47,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:46:47,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:46:47,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:46:47,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:46:47,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:46:47,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:46:47,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:46:47,321 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:46:47,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:46:47,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-25 15:46:47,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:46:47,340 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-25 15:46:47,340 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:01,269 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-25 15:47:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:01,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-25 15:47:01,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:01,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:47:01,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:47:01,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:47:01,292 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-25 15:47:01,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:01,452 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-25 15:47:01,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:47:01,453 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-25 15:47:01,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:01,453 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:47:01,453 INFO L226 Difference]: Without dead ends: 92 [2019-02-25 15:47:01,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:47:01,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-25 15:47:01,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-25 15:47:01,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:47:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-25 15:47:01,457 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-25 15:47:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:01,457 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-25 15:47:01,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:47:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-25 15:47:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-25 15:47:01,458 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:01,458 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-25 15:47:01,458 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-25 15:47:01,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:01,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:01,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:01,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:06,303 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-25 15:47:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:06,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:06,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:06,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:06,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:47:06,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:06,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:47:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:06,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-25 15:47:06,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:06,421 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-25 15:47:06,421 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:20,470 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-25 15:47:20,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:20,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-25 15:47:20,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:20,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:47:20,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:47:20,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:47:20,492 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-25 15:47:20,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:20,728 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-25 15:47:20,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:47:20,729 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-25 15:47:20,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:20,729 INFO L225 Difference]: With dead ends: 95 [2019-02-25 15:47:20,729 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:47:20,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:47:20,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:47:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:47:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:47:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-25 15:47:20,732 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-25 15:47:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:20,732 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-25 15:47:20,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:47:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-25 15:47:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:47:20,733 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:20,733 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-25 15:47:20,733 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-25 15:47:20,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:20,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:47:20,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:20,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:25,596 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-25 15:47:25,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:25,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:25,596 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:25,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:25,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:25,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:47:25,605 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:47:25,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:47:26,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-25 15:47:26,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:26,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:47:26,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:26,937 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-25 15:47:26,937 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:47:41,398 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-25 15:47:41,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:47:41,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-25 15:47:41,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:47:41,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:47:41,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:47:41,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:47:41,423 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-25 15:47:41,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:47:41,579 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-25 15:47:41,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:47:41,579 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-25 15:47:41,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:47:41,580 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:47:41,580 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:47:41,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.2s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:47:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:47:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-25 15:47:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:47:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-25 15:47:41,584 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-25 15:47:41,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:47:41,585 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-25 15:47:41,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:47:41,585 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-25 15:47:41,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:47:41,585 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:47:41,585 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-25 15:47:41,585 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:47:41,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:47:41,586 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-25 15:47:41,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:47:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:41,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:47:41,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:47:41,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:47:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:47:46,627 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-25 15:47:46,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:46,627 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:47:46,627 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:47:46,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:47:46,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:47:46,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:47:46,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:47:46,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:47:46,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:47:46,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:47:46,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-25 15:47:46,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:47:46,749 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-25 15:47:46,749 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:01,668 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-25 15:48:01,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:01,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-25 15:48:01,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:01,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-25 15:48:01,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-25 15:48:01,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:48:01,689 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-25 15:48:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:01,955 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-25 15:48:01,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:48:01,956 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-25 15:48:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:01,956 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:48:01,957 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:48:01,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:48:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:48:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:48:01,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:48:01,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-25 15:48:01,960 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-25 15:48:01,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:01,960 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-25 15:48:01,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-25 15:48:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-25 15:48:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:48:01,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:01,961 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-25 15:48:01,961 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:01,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:01,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-25 15:48:01,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:01,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:01,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:01,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:01,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:01,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:07,117 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-25 15:48:07,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:07,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:07,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:07,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:07,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:07,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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:07,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:48:07,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:48:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:07,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-25 15:48:07,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:07,243 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-25 15:48:07,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:22,652 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-25 15:48:22,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:22,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-25 15:48:22,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:22,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:48:22,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:48:22,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:48:22,674 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-25 15:48:22,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:22,878 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-25 15:48:22,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:48:22,878 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-25 15:48:22,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:22,879 INFO L225 Difference]: With dead ends: 98 [2019-02-25 15:48:22,879 INFO L226 Difference]: Without dead ends: 96 [2019-02-25 15:48:22,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:48:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-25 15:48:22,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-25 15:48:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-25 15:48:22,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-25 15:48:22,883 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-25 15:48:22,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:22,883 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-25 15:48:22,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:48:22,883 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-25 15:48:22,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-25 15:48:22,884 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:22,884 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-25 15:48:22,884 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:22,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:22,884 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-25 15:48:22,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:22,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:48:22,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:22,885 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:28,292 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-25 15:48:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:28,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:28,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:28,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:28,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:28,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:48:28,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:48:29,744 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-25 15:48:29,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:29,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:48:29,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:29,767 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-25 15:48:29,767 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:48:45,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-25 15:48:45,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:48:45,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-25 15:48:45,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:48:45,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:48:45,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:48:45,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:48:45,266 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-25 15:48:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:48:45,440 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:48:45,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:48:45,440 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-25 15:48:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:48:45,440 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:48:45,441 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:48:45,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:48:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:48:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:48:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:48:45,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:48:45,444 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-25 15:48:45,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:48:45,444 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:48:45,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:48:45,445 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:48:45,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:48:45,445 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:48:45,445 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-25 15:48:45,445 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:48:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:48:45,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-25 15:48:45,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:48:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:45,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:48:45,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:48:45,446 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:48:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:48:50,772 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-25 15:48:50,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:50,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:48:50,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:48:50,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:48:50,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:48:50,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:48:50,782 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:48:50,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:48:50,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:48:50,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:48:50,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:48:50,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:48:50,893 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-25 15:48:50,894 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:06,840 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-25 15:49:06,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:06,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-25 15:49:06,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:06,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:49:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:49:06,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:49:06,862 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-25 15:49:07,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:07,034 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-25 15:49:07,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:49:07,034 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-25 15:49:07,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:07,035 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:49:07,035 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:49:07,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:49:07,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:49:07,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-25 15:49:07,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:49:07,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-25 15:49:07,038 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-25 15:49:07,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:07,038 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-25 15:49:07,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:49:07,038 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-25 15:49:07,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-25 15:49:07,039 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:07,039 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-25 15:49:07,039 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-25 15:49:07,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:07,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:49:07,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:07,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:12,529 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-25 15:49:12,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:12,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:49:12,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:49:12,529 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:49:12,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:49:12,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:49:12,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:12,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:49:12,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:49:12,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-25 15:49:12,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:49:12,652 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-25 15:49:12,653 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:49:28,808 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-25 15:49:28,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:49:28,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-25 15:49:28,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:49:28,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-25 15:49:28,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-25 15:49:28,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:49:28,847 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-25 15:49:29,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:49:29,007 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-25 15:49:29,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:49:29,008 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-25 15:49:29,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:49:29,009 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:49:29,009 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:49:29,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:49:29,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:49:29,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:49:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:49:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-25 15:49:29,013 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-25 15:49:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:49:29,013 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-25 15:49:29,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-25 15:49:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-25 15:49:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:49:29,014 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:49:29,014 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-25 15:49:29,014 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:49:29,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:49:29,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-25 15:49:29,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:49:29,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:29,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:49:29,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:49:29,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:49:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat