java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0302a3f [2019-02-25 15:10:18,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-25 15:10:18,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-25 15:10:18,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-25 15:10:18,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-25 15:10:18,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-25 15:10:18,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-25 15:10:18,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-25 15:10:18,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-25 15:10:18,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-25 15:10:18,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-25 15:10:18,341 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-25 15:10:18,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-25 15:10:18,343 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-25 15:10:18,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-25 15:10:18,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-25 15:10:18,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-25 15:10:18,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-25 15:10:18,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-25 15:10:18,352 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-25 15:10:18,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-25 15:10:18,356 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-25 15:10:18,359 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-25 15:10:18,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-25 15:10:18,362 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-25 15:10:18,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-25 15:10:18,368 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-25 15:10:18,369 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-25 15:10:18,370 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-25 15:10:18,373 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-25 15:10:18,373 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-25 15:10:18,375 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-25 15:10:18,376 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-25 15:10:18,376 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-25 15:10:18,377 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-25 15:10:18,378 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-25 15:10:18,378 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-25 15:10:18,402 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-25 15:10:18,403 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-25 15:10:18,404 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-25 15:10:18,404 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-25 15:10:18,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-25 15:10:18,405 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-25 15:10:18,405 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-25 15:10:18,405 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-25 15:10:18,406 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-25 15:10:18,406 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-25 15:10:18,406 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-25 15:10:18,406 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-25 15:10:18,406 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-25 15:10:18,407 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-25 15:10:18,408 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-25 15:10:18,408 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-25 15:10:18,408 INFO L133 SettingsManager]: * Use SBE=true [2019-02-25 15:10:18,408 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-25 15:10:18,410 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-25 15:10:18,410 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-25 15:10:18,410 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-25 15:10:18,411 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-25 15:10:18,411 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-25 15:10:18,411 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-25 15:10:18,411 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-25 15:10:18,411 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-25 15:10:18,412 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-25 15:10:18,412 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-25 15:10:18,412 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-25 15:10:18,412 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-25 15:10:18,412 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,413 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-25 15:10:18,413 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-25 15:10:18,414 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-25 15:10:18,415 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-25 15:10:18,471 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-25 15:10:18,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-25 15:10:18,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-25 15:10:18,494 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-25 15:10:18,495 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-25 15:10:18,496 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-02-25 15:10:18,496 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-02-25 15:10:18,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-25 15:10:18,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-25 15:10:18,546 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,546 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-25 15:10:18,546 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-25 15:10:18,565 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,590 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-25 15:10:18,591 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,591 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-25 15:10:18,591 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-25 15:10:18,604 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... [2019-02-25 15:10:18,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-25 15:10:18,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-25 15:10:18,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-25 15:10:18,617 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-25 15:10:18,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-25 15:10:18,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-25 15:10:18,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-25 15:10:18,846 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-25 15:10:18,847 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-25 15:10:18,848 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:18 BoogieIcfgContainer [2019-02-25 15:10:18,848 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-25 15:10:18,850 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-25 15:10:18,850 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-25 15:10:18,853 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-25 15:10:18,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.02 03:10:18" (1/2) ... [2019-02-25 15:10:18,855 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e8094 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.02 03:10:18, skipping insertion in model container [2019-02-25 15:10:18,855 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.02 03:10:18" (2/2) ... [2019-02-25 15:10:18,857 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-02-25 15:10:18,867 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-25 15:10:18,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-25 15:10:18,893 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-25 15:10:18,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-25 15:10:18,927 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-25 15:10:18,927 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-25 15:10:18,927 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-25 15:10:18,928 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-25 15:10:18,928 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-25 15:10:18,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-25 15:10:18,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-25 15:10:18,944 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-25 15:10:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-25 15:10:18,950 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:18,951 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-25 15:10:18,956 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:18,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:18,966 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-25 15:10:18,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:19,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-25 15:10:19,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-25 15:10:19,099 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-25 15:10:19,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-25 15:10:19,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-25 15:10:19,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-25 15:10:19,116 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-25 15:10:19,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:19,162 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-25 15:10:19,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-25 15:10:19,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-25 15:10:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:19,176 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:10:19,176 INFO L226 Difference]: Without dead ends: 5 [2019-02-25 15:10:19,180 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:10:19,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-25 15:10:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-25 15:10:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-25 15:10:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-25 15:10:19,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-25 15:10:19,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:19,210 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-25 15:10:19,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-25 15:10:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-25 15:10:19,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-25 15:10:19,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-25 15:10:19,212 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,212 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-25 15:10:19,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,367 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:10:19,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:19,369 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-25 15:10:19,371 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-25 15:10:19,450 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-25 15:10:19,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-25 15:10:19,586 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-25 15:10:19,588 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 5. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-25 15:10:19,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-25 15:10:19,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:19,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:19,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,616 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:19,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:19,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-25 15:10:19,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:19,650 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:10:19,650 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:19,725 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:10:19,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:19,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-25 15:10:19,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:19,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-25 15:10:19,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-25 15:10:19,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-25 15:10:19,754 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-25 15:10:19,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:19,846 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-25 15:10:19,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-25 15:10:19,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-25 15:10:19,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:19,848 INFO L225 Difference]: With dead ends: 8 [2019-02-25 15:10:19,848 INFO L226 Difference]: Without dead ends: 6 [2019-02-25 15:10:19,868 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:10:19,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-25 15:10:19,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-25 15:10:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-25 15:10:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-25 15:10:19,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-25 15:10:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:19,876 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-25 15:10:19,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-25 15:10:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-25 15:10:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-25 15:10:19,877 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:19,877 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-25 15:10:19,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-25 15:10:19,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:19,880 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,048 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:10:20,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:20,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:20,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:20,104 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-25 15:10:20,104 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:20,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,114 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:10:20,115 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,234 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:10:20,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-25 15:10:20,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-25 15:10:20,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-25 15:10:20,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:20,256 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-25 15:10:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,323 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-25 15:10:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-25 15:10:20,324 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-25 15:10:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,325 INFO L225 Difference]: With dead ends: 9 [2019-02-25 15:10:20,325 INFO L226 Difference]: Without dead ends: 7 [2019-02-25 15:10:20,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-25 15:10:20,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-25 15:10:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-25 15:10:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-25 15:10:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-25 15:10:20,329 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-25 15:10:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,329 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-25 15:10:20,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-25 15:10:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-25 15:10:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-25 15:10:20,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,332 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-25 15:10:20,333 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,334 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-25 15:10:20,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:20,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,491 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:10:20,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:20,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:20,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:20,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:20,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:20,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,564 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:10:20,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:20,759 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:10:20,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:20,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-25 15:10:20,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:20,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-25 15:10:20,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-25 15:10:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:20,786 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-25 15:10:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:20,807 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-25 15:10:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-25 15:10:20,808 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-25 15:10:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:20,808 INFO L225 Difference]: With dead ends: 10 [2019-02-25 15:10:20,808 INFO L226 Difference]: Without dead ends: 8 [2019-02-25 15:10:20,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-25 15:10:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-25 15:10:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-25 15:10:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-25 15:10:20,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-25 15:10:20,812 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-25 15:10:20,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:20,812 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-25 15:10:20,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-25 15:10:20,812 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-25 15:10:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-25 15:10:20,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:20,813 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-25 15:10:20,813 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:20,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:20,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-25 15:10:20,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:20,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:20,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,902 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:10:20,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:20,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:20,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:10:20,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:20,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:20,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:20,913 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:20,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-25 15:10:20,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:20,943 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:10:20,943 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,152 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:10:21,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-25 15:10:21,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-25 15:10:21,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-25 15:10:21,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:21,172 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-25 15:10:21,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,193 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-25 15:10:21,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-25 15:10:21,195 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-25 15:10:21,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,196 INFO L225 Difference]: With dead ends: 11 [2019-02-25 15:10:21,196 INFO L226 Difference]: Without dead ends: 9 [2019-02-25 15:10:21,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-25 15:10:21,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-25 15:10:21,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-25 15:10:21,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-25 15:10:21,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-25 15:10:21,201 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-25 15:10:21,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,201 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-25 15:10:21,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-25 15:10:21,201 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-25 15:10:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-25 15:10:21,202 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,202 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-25 15:10:21,202 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-25 15:10:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,205 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:21,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,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:10:21,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,294 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:21,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:21,318 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-25 15:10:21,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:21,319 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,319 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,325 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:21,326 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:21,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-25 15:10:21,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:21,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-25 15:10:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-25 15:10:21,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-25 15:10:21,766 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-25 15:10:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:21,806 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-25 15:10:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-25 15:10:21,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-25 15:10:21,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:21,807 INFO L225 Difference]: With dead ends: 12 [2019-02-25 15:10:21,808 INFO L226 Difference]: Without dead ends: 10 [2019-02-25 15:10:21,808 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:10:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-25 15:10:21,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-25 15:10:21,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-25 15:10:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-25 15:10:21,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-25 15:10:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:21,812 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-25 15:10:21,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-25 15:10:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-25 15:10:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-25 15:10:21,812 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:21,812 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-25 15:10:21,813 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:21,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:21,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-25 15:10:21,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:21,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:21,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:21,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:21,932 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:10:21,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:21,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:21,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:21,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:21,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:21,944 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:21,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:21,970 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:21,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:21,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-25 15:10:21,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:21,978 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:10:21,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,202 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:10:22,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-25 15:10:22,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-25 15:10:22,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-25 15:10:22,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:10:22,222 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-25 15:10:22,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,258 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-25 15:10:22,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-25 15:10:22,259 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-25 15:10:22,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,260 INFO L225 Difference]: With dead ends: 13 [2019-02-25 15:10:22,260 INFO L226 Difference]: Without dead ends: 11 [2019-02-25 15:10:22,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-25 15:10:22,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-25 15:10:22,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-25 15:10:22,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-25 15:10:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-25 15:10:22,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-25 15:10:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,263 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-25 15:10:22,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-25 15:10:22,264 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-25 15:10:22,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-25 15:10:22,264 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,264 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-25 15:10:22,265 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,265 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-25 15:10:22,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,423 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:10:22,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,423 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:22,423 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:22,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:22,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:22,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:22,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-25 15:10:22,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:22,455 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:10:22,456 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:22,709 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:10:22,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:22,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-25 15:10:22,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:22,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-25 15:10:22,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-25 15:10:22,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:22,731 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-25 15:10:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:22,767 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-25 15:10:22,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-25 15:10:22,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-25 15:10:22,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:22,768 INFO L225 Difference]: With dead ends: 14 [2019-02-25 15:10:22,768 INFO L226 Difference]: Without dead ends: 12 [2019-02-25 15:10:22,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-25 15:10:22,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-25 15:10:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-25 15:10:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-25 15:10:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-25 15:10:22,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-25 15:10:22,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:22,772 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-25 15:10:22,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-25 15:10:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-25 15:10:22,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-25 15:10:22,773 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:22,773 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-25 15:10:22,773 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:22,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:22,773 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-25 15:10:22,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:22,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:22,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:22,995 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:10:22,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:22,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:22,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:22,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:22,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,005 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:23,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:23,015 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-25 15:10:23,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:23,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,024 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:10:23,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,207 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:10:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-25 15:10:23,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-25 15:10:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-25 15:10:23,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-25 15:10:23,227 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-25 15:10:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:23,272 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-25 15:10:23,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-25 15:10:23,273 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-25 15:10:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:23,273 INFO L225 Difference]: With dead ends: 15 [2019-02-25 15:10:23,273 INFO L226 Difference]: Without dead ends: 13 [2019-02-25 15:10:23,274 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:10:23,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-25 15:10:23,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-25 15:10:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-25 15:10:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-25 15:10:23,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-25 15:10:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:23,277 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-25 15:10:23,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-25 15:10:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-25 15:10:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-25 15:10:23,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:23,278 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-25 15:10:23,278 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:23,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-25 15:10:23,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,397 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:10:23,397 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,397 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:23,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:23,398 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:23,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:23,407 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:23,420 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:23,420 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:23,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,428 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:10:23,429 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:23,642 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:10:23,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:23,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-25 15:10:23,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:23,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-25 15:10:23,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-25 15:10:23,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:23,666 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-25 15:10:23,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:23,703 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-25 15:10:23,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-25 15:10:23,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-25 15:10:23,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:23,704 INFO L225 Difference]: With dead ends: 16 [2019-02-25 15:10:23,704 INFO L226 Difference]: Without dead ends: 14 [2019-02-25 15:10:23,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-25 15:10:23,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-25 15:10:23,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-25 15:10:23,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-25 15:10:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-25 15:10:23,707 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-25 15:10:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:23,708 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-25 15:10:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-25 15:10:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-25 15:10:23,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-25 15:10:23,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:23,709 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-25 15:10:23,709 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:23,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:23,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-25 15:10:23,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:23,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:23,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:23,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,889 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:10:23,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:23,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:23,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:10:23,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:23,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:23,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:23,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:23,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-25 15:10:23,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:23,932 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:10:23,932 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:10:24,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:24,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-25 15:10:24,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:24,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-25 15:10:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-25 15:10:24,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:10:24,138 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-25 15:10:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:24,167 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-25 15:10:24,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-25 15:10:24,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-25 15:10:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:24,168 INFO L225 Difference]: With dead ends: 17 [2019-02-25 15:10:24,168 INFO L226 Difference]: Without dead ends: 15 [2019-02-25 15:10:24,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-25 15:10:24,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-25 15:10:24,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-25 15:10:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-25 15:10:24,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-25 15:10:24,172 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-25 15:10:24,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:24,173 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-25 15:10:24,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-25 15:10:24,173 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-25 15:10:24,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-25 15:10:24,173 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:24,174 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-25 15:10:24,174 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:24,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:24,174 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-25 15:10:24,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:24,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:24,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:24,514 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:10:24,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:24,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:24,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:24,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:24,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:24,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:24,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:24,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-25 15:10:24,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:24,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-25 15:10:24,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:24,605 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:10:24,605 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:24,995 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:10:25,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:25,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-25 15:10:25,015 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:25,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-25 15:10:25,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-25 15:10:25,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-25 15:10:25,016 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-25 15:10:25,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:25,043 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-25 15:10:25,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-25 15:10:25,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-25 15:10:25,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:25,044 INFO L225 Difference]: With dead ends: 18 [2019-02-25 15:10:25,045 INFO L226 Difference]: Without dead ends: 16 [2019-02-25 15:10:25,046 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:10:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-25 15:10:25,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-25 15:10:25,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-25 15:10:25,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-25 15:10:25,049 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-25 15:10:25,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:25,050 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-25 15:10:25,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-25 15:10:25,050 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-25 15:10:25,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-25 15:10:25,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:25,050 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-25 15:10:25,051 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:25,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:25,051 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-25 15:10:25,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:25,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:25,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:25,266 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:10:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:25,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:25,267 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:25,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:25,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:25,267 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:25,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:25,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:25,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:25,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:25,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-25 15:10:25,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:25,323 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:10:25,323 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:25,775 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:10:25,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:25,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-25 15:10:25,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:25,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-25 15:10:25,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-25 15:10:25,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:10:25,798 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-25 15:10:25,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:25,840 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-25 15:10:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-25 15:10:25,845 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-25 15:10:25,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:25,846 INFO L225 Difference]: With dead ends: 19 [2019-02-25 15:10:25,846 INFO L226 Difference]: Without dead ends: 17 [2019-02-25 15:10:25,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-25 15:10:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-25 15:10:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-25 15:10:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-25 15:10:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-25 15:10:25,851 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-25 15:10:25,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:25,851 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-25 15:10:25,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-25 15:10:25,851 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-25 15:10:25,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-25 15:10:25,852 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:25,852 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-25 15:10:25,852 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:25,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-25 15:10:25,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:25,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:25,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:25,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:26,205 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:10:26,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:26,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:26,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:26,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:26,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:26,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:26,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:26,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:26,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-25 15:10:26,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:26,243 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:10:26,243 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:26,564 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:10:26,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:26,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-25 15:10:26,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:26,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-25 15:10:26,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-25 15:10:26,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:26,585 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-25 15:10:26,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:26,615 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-25 15:10:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-25 15:10:26,618 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-25 15:10:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:26,619 INFO L225 Difference]: With dead ends: 20 [2019-02-25 15:10:26,619 INFO L226 Difference]: Without dead ends: 18 [2019-02-25 15:10:26,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-25 15:10:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-25 15:10:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-25 15:10:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-25 15:10:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-25 15:10:26,623 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-25 15:10:26,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:26,623 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-25 15:10:26,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-25 15:10:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-25 15:10:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-25 15:10:26,623 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:26,623 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-25 15:10:26,624 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:26,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-25 15:10:26,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:26,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:26,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:26,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:26,625 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:27,192 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:10:27,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:27,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:27,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:27,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:10:27,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:27,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:27,203 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:27,203 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:27,222 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-25 15:10:27,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:27,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-25 15:10:27,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:27,232 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:10:27,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:27,835 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:10:27,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:27,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-25 15:10:27,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:27,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-25 15:10:27,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-25 15:10:27,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:27,857 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-25 15:10:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:27,897 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-25 15:10:27,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-25 15:10:27,898 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-25 15:10:27,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:27,899 INFO L225 Difference]: With dead ends: 21 [2019-02-25 15:10:27,899 INFO L226 Difference]: Without dead ends: 19 [2019-02-25 15:10:27,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-25 15:10:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-25 15:10:27,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-25 15:10:27,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-25 15:10:27,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-25 15:10:27,903 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-25 15:10:27,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:27,904 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-25 15:10:27,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-25 15:10:27,904 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-25 15:10:27,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-25 15:10:27,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:27,905 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-25 15:10:27,905 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:27,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-25 15:10:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:27,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:27,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:27,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:27,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:28,188 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:10:28,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:28,189 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:28,189 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:28,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:28,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:28,190 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:28,200 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:28,200 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:28,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:28,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:28,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-25 15:10:28,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:28,228 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:10:28,229 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:28,702 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:10:28,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:28,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-25 15:10:28,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:28,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-25 15:10:28,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-25 15:10:28,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:28,721 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-25 15:10:28,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:28,840 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-25 15:10:28,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-25 15:10:28,840 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-25 15:10:28,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:28,841 INFO L225 Difference]: With dead ends: 22 [2019-02-25 15:10:28,841 INFO L226 Difference]: Without dead ends: 20 [2019-02-25 15:10:28,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-25 15:10:28,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-25 15:10:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-25 15:10:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-25 15:10:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-25 15:10:28,845 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-25 15:10:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:28,845 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-25 15:10:28,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-25 15:10:28,845 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-25 15:10:28,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-25 15:10:28,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:28,846 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-25 15:10:28,846 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:28,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-25 15:10:28,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:28,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:28,847 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:29,548 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:10:29,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:29,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:29,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:29,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:29,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:29,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:29,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:29,567 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:29,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:29,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-25 15:10:29,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:29,591 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:10:29,592 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:30,245 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:10:30,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:30,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-25 15:10:30,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:30,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-25 15:10:30,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-25 15:10:30,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:30,265 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-25 15:10:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:30,292 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-25 15:10:30,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-25 15:10:30,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-25 15:10:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:30,294 INFO L225 Difference]: With dead ends: 23 [2019-02-25 15:10:30,294 INFO L226 Difference]: Without dead ends: 21 [2019-02-25 15:10:30,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-25 15:10:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-25 15:10:30,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-25 15:10:30,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-25 15:10:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-25 15:10:30,298 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-25 15:10:30,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:30,299 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-25 15:10:30,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-25 15:10:30,299 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-25 15:10:30,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-25 15:10:30,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:30,299 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-25 15:10:30,300 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:30,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:30,300 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-25 15:10:30,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:30,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:30,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:30,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:30,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:30,807 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:10:30,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:30,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:30,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:30,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:30,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:30,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:30,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:30,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-25 15:10:30,840 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:30,840 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-25 15:10:30,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:30,848 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:10:30,849 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:31,542 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:10:31,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:31,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-25 15:10:31,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:31,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-25 15:10:31,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-25 15:10:31,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:31,562 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-25 15:10:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:31,599 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-25 15:10:31,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-25 15:10:31,600 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-25 15:10:31,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:31,601 INFO L225 Difference]: With dead ends: 24 [2019-02-25 15:10:31,601 INFO L226 Difference]: Without dead ends: 22 [2019-02-25 15:10:31,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-25 15:10:31,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-25 15:10:31,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-25 15:10:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-25 15:10:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-25 15:10:31,607 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-25 15:10:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:31,607 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-25 15:10:31,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-25 15:10:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-25 15:10:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-25 15:10:31,608 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:31,608 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-25 15:10:31,609 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:31,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:31,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-25 15:10:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:31,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:31,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:31,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:32,261 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:10:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:32,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:32,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:32,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:32,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:32,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:32,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:32,284 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:32,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:32,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-25 15:10:32,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:32,294 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:10:32,295 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:32,786 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:10:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:32,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-25 15:10:32,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:32,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-25 15:10:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-25 15:10:32,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:32,807 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-25 15:10:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:32,856 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-25 15:10:32,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-25 15:10:32,857 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-25 15:10:32,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:32,858 INFO L225 Difference]: With dead ends: 25 [2019-02-25 15:10:32,858 INFO L226 Difference]: Without dead ends: 23 [2019-02-25 15:10:32,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-25 15:10:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-25 15:10:32,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-25 15:10:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-25 15:10:32,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-25 15:10:32,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-25 15:10:32,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:32,863 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-25 15:10:32,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-25 15:10:32,863 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-25 15:10:32,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-25 15:10:32,864 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:32,864 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-25 15:10:32,864 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:32,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:32,865 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-25 15:10:32,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:32,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,117 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:10:33,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:33,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:33,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:10:33,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:33,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:33,129 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-25 15:10:33,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:33,151 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:10:33,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:33,599 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:10:33,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:33,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-25 15:10:33,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:33,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-25 15:10:33,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-25 15:10:33,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:10:33,619 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-25 15:10:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:33,719 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-25 15:10:33,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-25 15:10:33,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-25 15:10:33,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:33,722 INFO L225 Difference]: With dead ends: 26 [2019-02-25 15:10:33,722 INFO L226 Difference]: Without dead ends: 24 [2019-02-25 15:10:33,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-25 15:10:33,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-25 15:10:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-25 15:10:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-25 15:10:33,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-25 15:10:33,725 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-25 15:10:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:33,726 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-25 15:10:33,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-25 15:10:33,726 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-25 15:10:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-25 15:10:33,726 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:33,727 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-25 15:10:33,727 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:33,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-25 15:10:33,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:33,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:33,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:33,728 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:33,972 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:10:33,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:33,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:33,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:33,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:33,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:33,982 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:33,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:34,010 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-25 15:10:34,010 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:34,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-25 15:10:34,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:34,020 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:10:34,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:34,521 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:10:34,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:34,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-25 15:10:34,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:34,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-25 15:10:34,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-25 15:10:34,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:34,541 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-25 15:10:34,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:34,587 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-25 15:10:34,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-25 15:10:34,587 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-25 15:10:34,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:34,588 INFO L225 Difference]: With dead ends: 27 [2019-02-25 15:10:34,588 INFO L226 Difference]: Without dead ends: 25 [2019-02-25 15:10:34,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-25 15:10:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-25 15:10:34,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-25 15:10:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-25 15:10:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-25 15:10:34,593 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-25 15:10:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:34,593 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-25 15:10:34,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-25 15:10:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-25 15:10:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-25 15:10:34,594 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:34,594 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-25 15:10:34,594 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:34,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:34,595 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-25 15:10:34,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:34,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:34,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:34,977 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:10:34,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:34,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:34,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:34,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:34,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:10:34,987 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:34,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:35,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:35,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:35,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-25 15:10:35,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:35,022 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:10:35,023 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:35,949 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:10:35,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:35,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-25 15:10:35,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:35,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-25 15:10:35,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-25 15:10:35,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:10:35,970 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-25 15:10:36,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:36,028 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-25 15:10:36,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-25 15:10:36,030 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-25 15:10:36,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:36,031 INFO L225 Difference]: With dead ends: 28 [2019-02-25 15:10:36,031 INFO L226 Difference]: Without dead ends: 26 [2019-02-25 15:10:36,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-25 15:10:36,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-25 15:10:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-25 15:10:36,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-25 15:10:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-25 15:10:36,035 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-25 15:10:36,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:36,036 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-25 15:10:36,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-25 15:10:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-25 15:10:36,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-25 15:10:36,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:36,037 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-25 15:10:36,037 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:36,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:36,037 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-25 15:10:36,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:36,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:36,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,763 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:10:36,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:36,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:36,764 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:36,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:36,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:36,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:36,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:36,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:36,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-25 15:10:36,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:36,802 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:10:36,802 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:37,536 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:10:37,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:37,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-25 15:10:37,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:37,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-25 15:10:37,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-25 15:10:37,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:10:37,557 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-25 15:10:37,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:37,593 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-25 15:10:37,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-25 15:10:37,595 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-25 15:10:37,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:37,595 INFO L225 Difference]: With dead ends: 29 [2019-02-25 15:10:37,595 INFO L226 Difference]: Without dead ends: 27 [2019-02-25 15:10:37,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-25 15:10:37,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-25 15:10:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-25 15:10:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-25 15:10:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-25 15:10:37,600 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-25 15:10:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:37,600 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-25 15:10:37,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-25 15:10:37,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-25 15:10:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-25 15:10:37,601 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:37,601 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-25 15:10:37,602 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-25 15:10:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:37,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:37,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:37,875 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:10:37,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:37,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:37,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:37,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:37,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:37,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:37,884 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:37,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-25 15:10:37,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:37,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-25 15:10:37,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:37,931 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:10:37,931 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:38,598 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:10:38,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:38,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-25 15:10:38,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:38,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-25 15:10:38,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-25 15:10:38,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:38,618 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-25 15:10:38,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:38,663 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-25 15:10:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-25 15:10:38,663 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-25 15:10:38,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:38,664 INFO L225 Difference]: With dead ends: 30 [2019-02-25 15:10:38,664 INFO L226 Difference]: Without dead ends: 28 [2019-02-25 15:10:38,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-25 15:10:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-25 15:10:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-25 15:10:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-25 15:10:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-25 15:10:38,669 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-25 15:10:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:38,670 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-25 15:10:38,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-25 15:10:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-25 15:10:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-25 15:10:38,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:38,671 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-25 15:10:38,671 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:38,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-25 15:10:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:38,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:38,672 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:39,785 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:10:39,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:39,786 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:39,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:39,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:39,787 INFO 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:10:39,799 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:39,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:39,814 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:39,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:39,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-25 15:10:39,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:39,825 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:10:39,825 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:40,594 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:10:40,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:40,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-25 15:10:40,615 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:40,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-25 15:10:40,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-25 15:10:40,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:10:40,617 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-25 15:10:40,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:40,695 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-25 15:10:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-25 15:10:40,696 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-25 15:10:40,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:40,696 INFO L225 Difference]: With dead ends: 31 [2019-02-25 15:10:40,696 INFO L226 Difference]: Without dead ends: 29 [2019-02-25 15:10:40,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-25 15:10:40,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-25 15:10:40,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-25 15:10:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-25 15:10:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-25 15:10:40,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-25 15:10:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:40,702 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-25 15:10:40,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-25 15:10:40,703 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-25 15:10:40,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-25 15:10:40,703 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:40,703 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-25 15:10:40,704 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-25 15:10:40,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:40,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,273 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:10:41,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:41,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:41,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:41,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:41,274 INFO 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:10:41,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:41,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:41,302 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-25 15:10:41,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:41,319 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:10:41,319 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:43,459 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:10:43,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:43,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-25 15:10:43,478 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:43,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-25 15:10:43,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-25 15:10:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:10:43,480 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-25 15:10:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:43,539 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-25 15:10:43,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-25 15:10:43,539 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-25 15:10:43,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:43,540 INFO L225 Difference]: With dead ends: 32 [2019-02-25 15:10:43,540 INFO L226 Difference]: Without dead ends: 30 [2019-02-25 15:10:43,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-25 15:10:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-25 15:10:43,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-25 15:10:43,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-25 15:10:43,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-25 15:10:43,545 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-25 15:10:43,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:43,545 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-25 15:10:43,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-25 15:10:43,545 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-25 15:10:43,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-25 15:10:43,546 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:43,546 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-25 15:10:43,546 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:43,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:43,546 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-25 15:10:43,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:43,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:43,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:43,900 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:10:43,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:43,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:43,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:43,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:43,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:43,900 INFO 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:10:43,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:43,909 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:43,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-25 15:10:43,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:43,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-25 15:10:43,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:43,960 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:10:43,960 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:44,804 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:10:44,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:44,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-25 15:10:44,824 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:44,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-25 15:10:44,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-25 15:10:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:44,825 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-25 15:10:45,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:45,052 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-25 15:10:45,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-25 15:10:45,052 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-25 15:10:45,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:45,053 INFO L225 Difference]: With dead ends: 33 [2019-02-25 15:10:45,053 INFO L226 Difference]: Without dead ends: 31 [2019-02-25 15:10:45,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-25 15:10:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-25 15:10:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-25 15:10:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-25 15:10:45,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-25 15:10:45,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-25 15:10:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:45,058 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-25 15:10:45,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-25 15:10:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-25 15:10:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-25 15:10:45,059 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:45,059 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-25 15:10:45,059 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:45,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:45,060 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-25 15:10:45,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:45,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:45,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:45,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:45,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:45,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:45,640 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:10:45,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:45,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:45,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:45,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:45,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:45,641 INFO 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:10:45,650 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:45,650 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:45,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:45,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:45,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-25 15:10:45,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:45,681 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:10:45,682 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:46,870 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:10:46,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:46,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-25 15:10:46,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:46,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-25 15:10:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-25 15:10:46,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:10:46,890 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-25 15:10:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:46,932 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-25 15:10:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-25 15:10:46,933 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-25 15:10:46,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:46,934 INFO L225 Difference]: With dead ends: 34 [2019-02-25 15:10:46,934 INFO L226 Difference]: Without dead ends: 32 [2019-02-25 15:10:46,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-25 15:10:46,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-25 15:10:46,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-25 15:10:46,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-25 15:10:46,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-25 15:10:46,939 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-25 15:10:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:46,940 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-25 15:10:46,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-25 15:10:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-25 15:10:46,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-25 15:10:46,941 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:46,941 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-25 15:10:46,941 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-25 15:10:46,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:46,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:46,942 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:46,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:46,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:47,443 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:10:47,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:47,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:47,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:47,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:47,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:47,444 INFO 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:10:47,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:47,453 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:47,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-25 15:10:47,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:47,481 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:10:47,481 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:48,568 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:10:48,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:48,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-25 15:10:48,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:48,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-25 15:10:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-25 15:10:48,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:10:48,588 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-25 15:10:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:48,709 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-25 15:10:48,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-25 15:10:48,710 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-25 15:10:48,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:48,710 INFO L225 Difference]: With dead ends: 35 [2019-02-25 15:10:48,710 INFO L226 Difference]: Without dead ends: 33 [2019-02-25 15:10:48,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-25 15:10:48,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-25 15:10:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-25 15:10:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-25 15:10:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-25 15:10:48,714 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-25 15:10:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:48,714 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-25 15:10:48,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-25 15:10:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-25 15:10:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-25 15:10:48,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:48,715 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-25 15:10:48,715 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:48,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:48,715 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-25 15:10:48,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:48,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:48,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:48,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:48,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:49,154 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:10:49,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:49,154 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:49,154 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:49,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:49,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:49,155 INFO 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:10:49,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:49,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:49,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-25 15:10:49,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:49,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-25 15:10:49,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:49,227 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:10:49,227 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:50,369 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:10:50,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:50,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-25 15:10:50,389 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:50,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-25 15:10:50,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-25 15:10:50,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:50,391 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-25 15:10:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:50,445 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-25 15:10:50,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-25 15:10:50,446 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-25 15:10:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:50,446 INFO L225 Difference]: With dead ends: 36 [2019-02-25 15:10:50,446 INFO L226 Difference]: Without dead ends: 34 [2019-02-25 15:10:50,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-25 15:10:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-25 15:10:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-25 15:10:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-25 15:10:50,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-25 15:10:50,449 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-25 15:10:50,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:50,449 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-25 15:10:50,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-25 15:10:50,450 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-25 15:10:50,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-25 15:10:50,450 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:50,450 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-25 15:10:50,451 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:50,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:50,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-25 15:10:50,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:50,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:50,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:51,016 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:10:51,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:51,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:51,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:51,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:51,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:51,017 INFO 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:10:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:51,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:51,051 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:51,051 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:51,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-25 15:10:51,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:51,061 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:10:51,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:52,273 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:10:52,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:52,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-25 15:10:52,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:52,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-25 15:10:52,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-25 15:10:52,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:52,293 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-25 15:10:52,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:52,376 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-25 15:10:52,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-25 15:10:52,376 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-25 15:10:52,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:52,377 INFO L225 Difference]: With dead ends: 37 [2019-02-25 15:10:52,377 INFO L226 Difference]: Without dead ends: 35 [2019-02-25 15:10:52,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-25 15:10:52,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-25 15:10:52,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-25 15:10:52,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-25 15:10:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-25 15:10:52,380 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-25 15:10:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:52,380 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-25 15:10:52,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-25 15:10:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-25 15:10:52,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-25 15:10:52,380 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:52,380 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-25 15:10:52,381 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:52,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:52,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-25 15:10:52,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:52,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:52,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:52,382 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,937 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:10:52,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,938 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:52,938 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:52,938 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:52,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:52,938 INFO 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:10:52,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:52,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:52,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-25 15:10:52,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:52,978 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:10:52,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:54,055 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:10:54,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:54,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-25 15:10:54,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:54,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-25 15:10:54,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-25 15:10:54,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:10:54,074 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-25 15:10:54,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:54,142 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-25 15:10:54,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-25 15:10:54,143 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-25 15:10:54,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:54,144 INFO L225 Difference]: With dead ends: 38 [2019-02-25 15:10:54,144 INFO L226 Difference]: Without dead ends: 36 [2019-02-25 15:10:54,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-25 15:10:54,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-25 15:10:54,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-25 15:10:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-25 15:10:54,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-25 15:10:54,148 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-25 15:10:54,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:54,148 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-25 15:10:54,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-25 15:10:54,149 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-25 15:10:54,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-25 15:10:54,149 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:54,149 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-25 15:10:54,149 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:54,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:54,150 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-25 15:10:54,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:54,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:54,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:54,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:54,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:54,844 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:10:54,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:54,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:54,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:54,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:54,845 INFO 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:10:54,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:10:54,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:10:54,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-25 15:10:54,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:54,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-25 15:10:54,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:54,929 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:10:54,929 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:56,580 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:10:56,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:56,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-25 15:10:56,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:56,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-25 15:10:56,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-25 15:10:56,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:10:56,600 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-25 15:10:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:56,666 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-25 15:10:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-25 15:10:56,666 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-25 15:10:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:56,667 INFO L225 Difference]: With dead ends: 39 [2019-02-25 15:10:56,667 INFO L226 Difference]: Without dead ends: 37 [2019-02-25 15:10:56,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-25 15:10:56,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-25 15:10:56,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-25 15:10:56,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-25 15:10:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-25 15:10:56,670 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-25 15:10:56,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:56,671 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-25 15:10:56,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-25 15:10:56,671 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-25 15:10:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-25 15:10:56,671 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:56,671 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-25 15:10:56,672 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:56,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-25 15:10:56,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:56,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:56,673 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:57,193 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:10:57,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:57,193 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:57,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:10:57,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:57,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:10:57,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:10:57,227 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:10:57,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:10:57,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-25 15:10:57,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:57,236 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:10:57,236 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:10:58,423 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:10:58,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:10:58,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-25 15:10:58,441 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:10:58,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-25 15:10:58,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-25 15:10:58,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:10:58,443 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-25 15:10:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:10:58,570 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-25 15:10:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-25 15:10:58,571 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-25 15:10:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:10:58,571 INFO L225 Difference]: With dead ends: 40 [2019-02-25 15:10:58,572 INFO L226 Difference]: Without dead ends: 38 [2019-02-25 15:10:58,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-25 15:10:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-25 15:10:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-25 15:10:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-25 15:10:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-25 15:10:58,575 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-25 15:10:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:10:58,576 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-25 15:10:58,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-25 15:10:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-25 15:10:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-25 15:10:58,576 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:10:58,576 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-25 15:10:58,576 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:10:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:10:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-25 15:10:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:10:58,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:10:58,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:10:58,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:10:58,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:59,133 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:10:59,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:59,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:10:59,134 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:10:59,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:10:59,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:10:59,134 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:59,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:10:59,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:10:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:10:59,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-25 15:10:59,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:10:59,187 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:10:59,188 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:00,511 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:11:00,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:00,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-25 15:11:00,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:00,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-25 15:11:00,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-25 15:11:00,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:11:00,531 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-25 15:11:00,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:00,596 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-25 15:11:00,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-25 15:11:00,596 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-25 15:11:00,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:00,597 INFO L225 Difference]: With dead ends: 41 [2019-02-25 15:11:00,597 INFO L226 Difference]: Without dead ends: 39 [2019-02-25 15:11:00,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-25 15:11:00,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-25 15:11:00,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-25 15:11:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-25 15:11:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-25 15:11:00,600 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-25 15:11:00,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:00,601 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-25 15:11:00,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-25 15:11:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-25 15:11:00,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-25 15:11:00,601 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:00,601 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-25 15:11:00,602 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-25 15:11:00,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:00,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:01,485 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:11:01,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:01,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:01,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:01,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:11:01,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:01,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:01,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:01,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:01,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-25 15:11:01,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:01,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-25 15:11:01,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:01,587 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:11:01,588 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:02,885 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:11:02,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:02,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-25 15:11:02,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:02,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-25 15:11:02,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-25 15:11:02,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:02,905 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-25 15:11:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:02,953 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-25 15:11:02,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-25 15:11:02,954 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-25 15:11:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:02,954 INFO L225 Difference]: With dead ends: 42 [2019-02-25 15:11:02,955 INFO L226 Difference]: Without dead ends: 40 [2019-02-25 15:11:02,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-25 15:11:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-25 15:11:02,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-25 15:11:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-25 15:11:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-25 15:11:02,957 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-25 15:11:02,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:02,957 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-25 15:11:02,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-25 15:11:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-25 15:11:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-25 15:11:02,958 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:02,958 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-25 15:11:02,958 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:02,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:02,959 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-25 15:11:02,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:02,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:02,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:02,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:03,744 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:11:03,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:03,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:03,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:03,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:03,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:03,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:03,755 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:03,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:03,778 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:03,778 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:03,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-25 15:11:03,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:03,788 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:11:03,788 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:11:05,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:05,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-25 15:11:05,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:05,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-25 15:11:05,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-25 15:11:05,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:11:05,297 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-25 15:11:05,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:05,363 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-25 15:11:05,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-25 15:11:05,363 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-25 15:11:05,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:05,364 INFO L225 Difference]: With dead ends: 43 [2019-02-25 15:11:05,364 INFO L226 Difference]: Without dead ends: 41 [2019-02-25 15:11:05,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-25 15:11:05,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-25 15:11:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-25 15:11:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-25 15:11:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-25 15:11:05,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-25 15:11:05,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:05,367 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-25 15:11:05,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-25 15:11:05,367 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-25 15:11:05,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-25 15:11:05,368 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:05,368 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-25 15:11:05,368 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:05,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:05,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-25 15:11:05,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:05,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:05,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:05,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:05,993 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:11:05,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:05,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:05,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:05,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:05,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:05,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:06,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:06,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:06,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-25 15:11:06,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:06,048 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:11:06,049 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:07,771 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:11:07,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:07,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-25 15:11:07,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:07,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-25 15:11:07,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-25 15:11:07,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:11:07,792 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-25 15:11:07,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:07,856 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-25 15:11:07,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-25 15:11:07,857 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-25 15:11:07,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:07,858 INFO L225 Difference]: With dead ends: 44 [2019-02-25 15:11:07,858 INFO L226 Difference]: Without dead ends: 42 [2019-02-25 15:11:07,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-25 15:11:07,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-25 15:11:07,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-25 15:11:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-25 15:11:07,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-25 15:11:07,860 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-25 15:11:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:07,860 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-25 15:11:07,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-25 15:11:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-25 15:11:07,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-25 15:11:07,861 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:07,861 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-25 15:11:07,861 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:07,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:07,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-25 15:11:07,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:07,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:07,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:07,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:08,554 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:11:08,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:08,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:08,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:08,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:08,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:08,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:08,564 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:08,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:08,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-25 15:11:08,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:08,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-25 15:11:08,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:08,661 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:11:08,662 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:10,255 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:11:10,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:10,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-25 15:11:10,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:10,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-25 15:11:10,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-25 15:11:10,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:10,275 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-25 15:11:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:10,335 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-25 15:11:10,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-25 15:11:10,335 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-25 15:11:10,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:10,336 INFO L225 Difference]: With dead ends: 45 [2019-02-25 15:11:10,336 INFO L226 Difference]: Without dead ends: 43 [2019-02-25 15:11:10,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-25 15:11:10,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-25 15:11:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-25 15:11:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-25 15:11:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-25 15:11:10,339 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-25 15:11:10,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:10,339 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-25 15:11:10,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-25 15:11:10,339 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-25 15:11:10,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-25 15:11:10,340 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:10,340 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-25 15:11:10,340 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-25 15:11:10,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:10,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:10,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:10,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:11,089 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:11:11,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:11,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:11,089 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:11,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:11,089 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:11,089 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:11,097 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:11,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:11,124 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:11,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:11,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-25 15:11:11,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:11,132 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:11:11,132 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:12,987 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:11:13,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:13,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-25 15:11:13,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:13,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-25 15:11:13,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-25 15:11:13,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:11:13,007 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-25 15:11:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:13,074 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-25 15:11:13,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-25 15:11:13,075 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-25 15:11:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:13,075 INFO L225 Difference]: With dead ends: 46 [2019-02-25 15:11:13,075 INFO L226 Difference]: Without dead ends: 44 [2019-02-25 15:11:13,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-25 15:11:13,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-25 15:11:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-25 15:11:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-25 15:11:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-25 15:11:13,078 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-25 15:11:13,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:13,078 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-25 15:11:13,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-25 15:11:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-25 15:11:13,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-25 15:11:13,079 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:13,079 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-25 15:11:13,079 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-25 15:11:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:13,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:13,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:13,804 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:11:13,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:13,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:13,805 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:13,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:13,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:13,805 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:11:13,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:13,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:13,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-25 15:11:13,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:13,864 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:11:13,864 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:15,821 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:11:15,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:15,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-25 15:11:15,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:15,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-25 15:11:15,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-25 15:11:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:11:15,841 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-25 15:11:15,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:15,931 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-25 15:11:15,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-25 15:11:15,932 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-25 15:11:15,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:15,933 INFO L225 Difference]: With dead ends: 47 [2019-02-25 15:11:15,933 INFO L226 Difference]: Without dead ends: 45 [2019-02-25 15:11:15,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-25 15:11:15,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-25 15:11:15,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-25 15:11:15,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-25 15:11:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-25 15:11:15,936 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-25 15:11:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:15,936 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-25 15:11:15,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-25 15:11:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-25 15:11:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-25 15:11:15,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:15,937 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-25 15:11:15,937 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:15,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:15,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-25 15:11:15,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:15,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:15,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:15,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:15,938 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:17,570 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:11:17,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:17,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:17,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:17,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:11:17,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:17,571 INFO 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:11:17,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:17,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:17,688 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-25 15:11:17,689 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:17,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-25 15:11:17,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:17,702 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:11:17,703 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:19,662 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:11:19,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:19,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-25 15:11:19,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:19,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-25 15:11:19,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-25 15:11:19,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:19,681 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-25 15:11:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:19,755 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-25 15:11:19,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-25 15:11:19,756 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-25 15:11:19,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:19,757 INFO L225 Difference]: With dead ends: 48 [2019-02-25 15:11:19,757 INFO L226 Difference]: Without dead ends: 46 [2019-02-25 15:11:19,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-25 15:11:19,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-25 15:11:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-25 15:11:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-25 15:11:19,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-25 15:11:19,760 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-25 15:11:19,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:19,760 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-25 15:11:19,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-25 15:11:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-25 15:11:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-25 15:11:19,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:19,760 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-25 15:11:19,761 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-25 15:11:19,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:19,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:19,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:19,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:20,504 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:11:20,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:20,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:20,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:20,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:20,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:20,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11:20,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:20,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:20,541 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:20,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:20,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-25 15:11:20,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:20,551 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:11:20,551 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:22,762 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:11:22,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:22,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-25 15:11:22,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:22,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-25 15:11:22,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-25 15:11:22,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:11:22,781 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-25 15:11:22,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:22,829 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-25 15:11:22,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-25 15:11:22,829 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-25 15:11:22,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:22,830 INFO L225 Difference]: With dead ends: 49 [2019-02-25 15:11:22,830 INFO L226 Difference]: Without dead ends: 47 [2019-02-25 15:11:22,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-25 15:11:22,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-25 15:11:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-25 15:11:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-25 15:11:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-25 15:11:22,834 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-25 15:11:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:22,834 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-25 15:11:22,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-25 15:11:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-25 15:11:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-25 15:11:22,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:22,835 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-25 15:11:22,835 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:22,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:22,835 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-25 15:11:22,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:22,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:22,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:23,731 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:11:23,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:23,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:23,732 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:23,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:23,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:23,732 INFO 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:11:23,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:23,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:23,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-25 15:11:23,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:23,779 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:11:23,779 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:25,825 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:11:25,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:25,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-25 15:11:25,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:25,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-25 15:11:25,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-25 15:11:25,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:11:25,844 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-25 15:11:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:25,917 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-25 15:11:25,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-25 15:11:25,918 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-25 15:11:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:25,918 INFO L225 Difference]: With dead ends: 50 [2019-02-25 15:11:25,919 INFO L226 Difference]: Without dead ends: 48 [2019-02-25 15:11:25,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-25 15:11:25,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-25 15:11:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-25 15:11:25,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-25 15:11:25,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-25 15:11:25,922 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-25 15:11:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:25,922 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-25 15:11:25,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-25 15:11:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-25 15:11:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-25 15:11:25,923 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:25,924 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-25 15:11:25,924 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-25 15:11:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:25,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:25,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:25,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:27,571 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:11:27,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:27,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:27,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:27,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:11:27,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:27,571 INFO 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:11:27,580 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:27,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:27,703 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-25 15:11:27,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:27,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-25 15:11:27,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:27,712 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:11:27,712 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:29,792 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:11:29,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:29,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-25 15:11:29,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:29,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-25 15:11:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-25 15:11:29,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:29,812 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-25 15:11:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:29,920 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-25 15:11:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-25 15:11:29,920 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-25 15:11:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:29,921 INFO L225 Difference]: With dead ends: 51 [2019-02-25 15:11:29,921 INFO L226 Difference]: Without dead ends: 49 [2019-02-25 15:11:29,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-25 15:11:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-25 15:11:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-25 15:11:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-25 15:11:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-25 15:11:29,925 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-25 15:11:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:29,925 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-25 15:11:29,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-25 15:11:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-25 15:11:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-25 15:11:29,926 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:29,926 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-25 15:11:29,926 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-25 15:11:29,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:29,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:29,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:29,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:29,928 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:30,793 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:11:30,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:30,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:30,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:30,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:30,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:30,794 INFO 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:11:30,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:30,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:30,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:30,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:30,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-25 15:11:30,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:30,869 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:11:30,869 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:33,301 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:11:33,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:33,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-25 15:11:33,319 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:33,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-25 15:11:33,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-25 15:11:33,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:33,320 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-25 15:11:33,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:33,700 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-25 15:11:33,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-25 15:11:33,700 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-25 15:11:33,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:33,701 INFO L225 Difference]: With dead ends: 52 [2019-02-25 15:11:33,701 INFO L226 Difference]: Without dead ends: 50 [2019-02-25 15:11:33,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-25 15:11:33,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-25 15:11:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-25 15:11:33,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-25 15:11:33,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-25 15:11:33,705 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-25 15:11:33,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:33,705 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-25 15:11:33,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-25 15:11:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-25 15:11:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-25 15:11:33,706 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:33,706 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-25 15:11:33,706 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:33,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:33,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-25 15:11:33,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:33,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:33,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:33,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:33,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:34,632 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:11:34,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:34,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:34,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:34,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:34,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:34,634 INFO 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:11:34,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:34,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:34,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-25 15:11:34,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:34,683 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:11:34,683 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:37,318 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:11:37,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:37,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-25 15:11:37,336 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:37,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-25 15:11:37,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-25 15:11:37,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:11:37,337 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-25 15:11:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:37,423 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-25 15:11:37,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-25 15:11:37,424 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-25 15:11:37,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:37,425 INFO L225 Difference]: With dead ends: 53 [2019-02-25 15:11:37,425 INFO L226 Difference]: Without dead ends: 51 [2019-02-25 15:11:37,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-25 15:11:37,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-25 15:11:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-25 15:11:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-25 15:11:37,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-25 15:11:37,428 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-25 15:11:37,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:37,428 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-25 15:11:37,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-25 15:11:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-25 15:11:37,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-25 15:11:37,429 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:37,429 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-25 15:11:37,429 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:37,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:37,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-25 15:11:37,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:37,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:37,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:37,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:37,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:38,637 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:11:38,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:38,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:38,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:38,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:38,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:38,637 INFO 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:11:38,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:38,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:38,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-25 15:11:38,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:38,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-25 15:11:38,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:38,812 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:11:38,813 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:41,178 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:11:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:41,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-25 15:11:41,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:41,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-25 15:11:41,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-25 15:11:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:41,198 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-25 15:11:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:41,258 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-25 15:11:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-25 15:11:41,258 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-25 15:11:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:41,259 INFO L225 Difference]: With dead ends: 54 [2019-02-25 15:11:41,259 INFO L226 Difference]: Without dead ends: 52 [2019-02-25 15:11:41,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-25 15:11:41,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-25 15:11:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-25 15:11:41,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-25 15:11:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-25 15:11:41,263 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-25 15:11:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:41,263 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-25 15:11:41,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-25 15:11:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-25 15:11:41,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-25 15:11:41,264 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:41,264 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-25 15:11:41,265 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:41,265 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-25 15:11:41,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:41,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:41,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:41,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:42,273 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:11:42,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:42,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:42,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:42,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:42,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:42,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11:42,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:42,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:42,320 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:42,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:42,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-25 15:11:42,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:42,330 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:11:42,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:44,805 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:11:44,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:44,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-25 15:11:44,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:44,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-25 15:11:44,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-25 15:11:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:11:44,835 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-25 15:11:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:44,982 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-25 15:11:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-25 15:11:44,983 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-25 15:11:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:44,983 INFO L225 Difference]: With dead ends: 55 [2019-02-25 15:11:44,983 INFO L226 Difference]: Without dead ends: 53 [2019-02-25 15:11:44,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-25 15:11:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-25 15:11:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-25 15:11:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-25 15:11:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-25 15:11:44,986 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-25 15:11:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:44,986 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-25 15:11:44,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-25 15:11:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-25 15:11:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-25 15:11:44,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:44,986 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-25 15:11:44,987 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:44,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-25 15:11:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:44,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:44,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:44,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:45,973 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:11:45,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:45,973 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:45,973 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:45,973 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:45,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:45,973 INFO 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:11:45,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:45,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:46,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-25 15:11:46,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:46,024 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:11:46,024 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:49,186 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:11:49,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:49,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-25 15:11:49,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:49,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-25 15:11:49,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-25 15:11:49,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:11:49,206 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-25 15:11:49,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:49,264 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-25 15:11:49,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-25 15:11:49,265 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-25 15:11:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:49,266 INFO L225 Difference]: With dead ends: 56 [2019-02-25 15:11:49,266 INFO L226 Difference]: Without dead ends: 54 [2019-02-25 15:11:49,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-25 15:11:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-25 15:11:49,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-25 15:11:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-25 15:11:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-25 15:11:49,269 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-25 15:11:49,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:49,269 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-25 15:11:49,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-25 15:11:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-25 15:11:49,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-25 15:11:49,270 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:49,270 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-25 15:11:49,270 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:49,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:49,271 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-25 15:11:49,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:49,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:49,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:49,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:49,272 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:50,469 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:11:50,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:50,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:50,470 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:50,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:50,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:50,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11:50,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:11:50,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:11:50,654 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-25 15:11:50,654 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:50,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-25 15:11:50,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:50,670 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:11:50,670 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:53,695 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:11:53,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:53,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-25 15:11:53,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:53,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-25 15:11:53,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-25 15:11:53,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:11:53,727 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-25 15:11:53,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:53,879 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-25 15:11:53,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-25 15:11:53,880 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-25 15:11:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:53,881 INFO L225 Difference]: With dead ends: 57 [2019-02-25 15:11:53,881 INFO L226 Difference]: Without dead ends: 55 [2019-02-25 15:11:53,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-25 15:11:53,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-25 15:11:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-25 15:11:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-25 15:11:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-25 15:11:53,884 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-25 15:11:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:53,884 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-25 15:11:53,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-25 15:11:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-25 15:11:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-25 15:11:53,884 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:53,885 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-25 15:11:53,885 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:53,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-25 15:11:53,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:53,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:53,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:53,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:53,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:55,014 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:11:55,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:55,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:55,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:55,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:55,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:55,014 INFO 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:11:55,023 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:11:55,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:11:55,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:11:55,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:11:55,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-25 15:11:55,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:55,070 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:11:55,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:11:58,225 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:11:58,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:11:58,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-25 15:11:58,243 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:11:58,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-25 15:11:58,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-25 15:11:58,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:11:58,244 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-25 15:11:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:11:58,334 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-25 15:11:58,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-25 15:11:58,335 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-25 15:11:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:11:58,335 INFO L225 Difference]: With dead ends: 58 [2019-02-25 15:11:58,335 INFO L226 Difference]: Without dead ends: 56 [2019-02-25 15:11:58,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-25 15:11:58,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-25 15:11:58,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-25 15:11:58,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-25 15:11:58,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-25 15:11:58,337 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-25 15:11:58,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:11:58,338 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-25 15:11:58,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-25 15:11:58,338 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-25 15:11:58,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-25 15:11:58,338 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:11:58,338 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-25 15:11:58,339 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:11:58,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:11:58,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-25 15:11:58,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:11:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:58,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:11:58,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:11:58,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:11:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:59,433 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:11:59,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:59,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:11:59,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:11:59,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:11:59,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:11:59,433 INFO 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:11:59,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:11:59,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:11:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:11:59,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-25 15:11:59,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:11:59,490 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:11:59,490 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:02,395 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:12:02,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:02,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-25 15:12:02,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:02,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-25 15:12:02,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-25 15:12:02,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:12:02,414 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-25 15:12:02,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:02,556 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-25 15:12:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-25 15:12:02,557 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-25 15:12:02,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:02,557 INFO L225 Difference]: With dead ends: 59 [2019-02-25 15:12:02,557 INFO L226 Difference]: Without dead ends: 57 [2019-02-25 15:12:02,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-25 15:12:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-25 15:12:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-25 15:12:02,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-25 15:12:02,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-25 15:12:02,560 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-25 15:12:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:02,560 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-25 15:12:02,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-25 15:12:02,561 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-25 15:12:02,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-25 15:12:02,561 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:02,561 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-25 15:12:02,561 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:02,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:02,562 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-25 15:12:02,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:02,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:02,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:03,867 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:12:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:03,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:03,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:03,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:03,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:03,868 INFO 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:12:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:03,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:04,092 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-25 15:12:04,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:04,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-25 15:12:04,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:04,105 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:12:04,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:07,030 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:12:07,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:07,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-25 15:12:07,050 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:07,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-25 15:12:07,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-25 15:12:07,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:12:07,051 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-25 15:12:07,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:07,119 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-25 15:12:07,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-25 15:12:07,120 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-25 15:12:07,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:07,121 INFO L225 Difference]: With dead ends: 60 [2019-02-25 15:12:07,121 INFO L226 Difference]: Without dead ends: 58 [2019-02-25 15:12:07,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-25 15:12:07,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-25 15:12:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-25 15:12:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-25 15:12:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-25 15:12:07,124 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-25 15:12:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:07,124 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-25 15:12:07,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-25 15:12:07,125 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-25 15:12:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-25 15:12:07,125 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:07,125 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-25 15:12:07,125 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:07,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-25 15:12:07,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:07,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:07,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:07,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:08,660 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:12:08,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:08,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:08,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:08,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:08,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:08,661 INFO 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:12:08,670 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:08,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:08,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:08,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:08,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-25 15:12:08,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:08,715 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:12:08,715 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:11,841 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:12:11,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:11,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-25 15:12:11,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:11,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-25 15:12:11,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-25 15:12:11,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:12:11,862 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-25 15:12:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:11,951 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-25 15:12:11,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-25 15:12:11,951 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-25 15:12:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:11,952 INFO L225 Difference]: With dead ends: 61 [2019-02-25 15:12:11,952 INFO L226 Difference]: Without dead ends: 59 [2019-02-25 15:12:11,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-25 15:12:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-25 15:12:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-25 15:12:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-25 15:12:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-25 15:12:11,955 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-25 15:12:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:11,955 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-25 15:12:11,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-25 15:12:11,955 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-25 15:12:11,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-25 15:12:11,955 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:11,956 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-25 15:12:11,956 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:11,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:11,956 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-25 15:12:11,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:11,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:11,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:11,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:13,432 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:12:13,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:13,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:13,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:13,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:13,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:13,433 INFO 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:12:13,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:13,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:13,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-25 15:12:13,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:13,488 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:12:13,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:16,740 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:12:16,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:16,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-25 15:12:16,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:16,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-25 15:12:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-25 15:12:16,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:12:16,759 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-25 15:12:16,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:16,873 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-25 15:12:16,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-25 15:12:16,874 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-25 15:12:16,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:16,874 INFO L225 Difference]: With dead ends: 62 [2019-02-25 15:12:16,874 INFO L226 Difference]: Without dead ends: 60 [2019-02-25 15:12:16,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-25 15:12:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-25 15:12:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-25 15:12:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-25 15:12:16,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-25 15:12:16,877 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-25 15:12:16,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:16,877 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-25 15:12:16,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-25 15:12:16,877 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-25 15:12:16,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-25 15:12:16,878 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:16,878 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-25 15:12:16,878 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:16,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:16,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-25 15:12:16,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:16,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:16,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:16,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:16,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:18,505 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:12:18,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:18,506 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:18,506 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:18,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:18,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:18,506 INFO 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:12:18,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:18,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:18,762 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-25 15:12:18,762 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:18,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-25 15:12:18,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:18,776 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:12:18,776 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:22,057 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:12:22,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:22,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-25 15:12:22,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:22,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-25 15:12:22,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-25 15:12:22,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:12:22,077 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-25 15:12:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:22,150 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-25 15:12:22,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-25 15:12:22,151 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-25 15:12:22,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:22,152 INFO L225 Difference]: With dead ends: 63 [2019-02-25 15:12:22,152 INFO L226 Difference]: Without dead ends: 61 [2019-02-25 15:12:22,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-25 15:12:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-25 15:12:22,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-25 15:12:22,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-25 15:12:22,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-25 15:12:22,155 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-25 15:12:22,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:22,155 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-25 15:12:22,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-25 15:12:22,156 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-25 15:12:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-25 15:12:22,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:22,156 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-25 15:12:22,156 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:22,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-25 15:12:22,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:22,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:22,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:22,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:22,158 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:23,648 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:12:23,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:23,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:23,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:23,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:23,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:23,649 INFO 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:12:23,656 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:23,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:23,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:23,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:23,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-25 15:12:23,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:23,705 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:12:23,705 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:27,048 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:12:27,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:27,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-25 15:12:27,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:27,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-25 15:12:27,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-25 15:12:27,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:12:27,067 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-25 15:12:27,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:27,165 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-25 15:12:27,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-25 15:12:27,165 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-25 15:12:27,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:27,166 INFO L225 Difference]: With dead ends: 64 [2019-02-25 15:12:27,166 INFO L226 Difference]: Without dead ends: 62 [2019-02-25 15:12:27,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-25 15:12:27,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-25 15:12:27,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-25 15:12:27,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-25 15:12:27,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-25 15:12:27,170 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-25 15:12:27,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:27,170 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-25 15:12:27,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-25 15:12:27,170 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-25 15:12:27,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-25 15:12:27,171 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:27,171 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-25 15:12:27,171 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:27,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:27,171 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-25 15:12:27,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:27,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:27,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:27,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:28,753 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:12:28,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:28,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:28,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:28,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:28,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:28,753 INFO 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:12:28,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:28,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:28,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-25 15:12:28,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:28,816 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:12:28,816 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:32,361 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:12:32,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:32,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-25 15:12:32,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:32,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-25 15:12:32,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-25 15:12:32,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:12:32,381 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-25 15:12:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:32,470 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-25 15:12:32,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-25 15:12:32,471 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-25 15:12:32,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:32,471 INFO L225 Difference]: With dead ends: 65 [2019-02-25 15:12:32,472 INFO L226 Difference]: Without dead ends: 63 [2019-02-25 15:12:32,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-25 15:12:32,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-25 15:12:32,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-25 15:12:32,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-25 15:12:32,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-25 15:12:32,475 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-25 15:12:32,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:32,475 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-25 15:12:32,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-25 15:12:32,475 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-25 15:12:32,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-25 15:12:32,476 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:32,476 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-25 15:12:32,476 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:32,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:32,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-25 15:12:32,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:32,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:32,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:32,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:34,237 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:12:34,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:34,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:34,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:34,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:12:34,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:34,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 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:12:34,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:34,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:34,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-25 15:12:34,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:34,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-25 15:12:34,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:34,562 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:12:34,563 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:38,193 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:12:38,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:38,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-25 15:12:38,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:38,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-25 15:12:38,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-25 15:12:38,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:12:38,214 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-25 15:12:38,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:38,290 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-25 15:12:38,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-25 15:12:38,290 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-25 15:12:38,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:38,291 INFO L225 Difference]: With dead ends: 66 [2019-02-25 15:12:38,291 INFO L226 Difference]: Without dead ends: 64 [2019-02-25 15:12:38,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-25 15:12:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-25 15:12:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-25 15:12:38,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-25 15:12:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-25 15:12:38,294 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-25 15:12:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:38,294 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-25 15:12:38,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-25 15:12:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-25 15:12:38,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-25 15:12:38,294 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:38,294 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-25 15:12:38,295 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:38,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:38,295 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-25 15:12:38,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:38,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:38,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:38,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:38,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:40,083 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:12:40,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:40,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:40,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:40,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:40,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:40,084 INFO 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:12:40,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:12:40,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:12:40,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:12:40,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:40,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-25 15:12:40,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:40,141 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:12:40,141 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:44,268 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:12:44,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:44,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-25 15:12:44,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:44,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-25 15:12:44,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-25 15:12:44,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:12:44,288 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-25 15:12:44,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:44,392 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-25 15:12:44,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-25 15:12:44,392 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-25 15:12:44,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:44,393 INFO L225 Difference]: With dead ends: 67 [2019-02-25 15:12:44,393 INFO L226 Difference]: Without dead ends: 65 [2019-02-25 15:12:44,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-25 15:12:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-25 15:12:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-25 15:12:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-25 15:12:44,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-25 15:12:44,395 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-25 15:12:44,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:44,396 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-25 15:12:44,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-25 15:12:44,396 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-25 15:12:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-25 15:12:44,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:44,396 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-25 15:12:44,396 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:44,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:44,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-25 15:12:44,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:44,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:44,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:44,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:44,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:45,961 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:12:45,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:45,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:45,962 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:45,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:45,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:45,962 INFO 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:12:45,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:45,970 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:12:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:46,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-25 15:12:46,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:46,020 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:12:46,020 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:50,313 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:12:50,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:50,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-25 15:12:50,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:50,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-25 15:12:50,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-25 15:12:50,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:12:50,333 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-25 15:12:50,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:50,447 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-25 15:12:50,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-25 15:12:50,447 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-25 15:12:50,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:50,448 INFO L225 Difference]: With dead ends: 68 [2019-02-25 15:12:50,448 INFO L226 Difference]: Without dead ends: 66 [2019-02-25 15:12:50,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-25 15:12:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-25 15:12:50,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-25 15:12:50,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-25 15:12:50,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-25 15:12:50,450 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-25 15:12:50,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:50,451 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-25 15:12:50,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-25 15:12:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-25 15:12:50,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-25 15:12:50,451 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:50,451 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-25 15:12:50,451 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:50,452 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-25 15:12:50,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:50,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:12:50,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:50,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:12:53,424 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:12:53,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:53,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:12:53,424 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:12:53,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:12:53,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:12:53,425 INFO 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:12:53,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:12:53,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:12:53,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-25 15:12:53,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:12:53,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-25 15:12:53,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:12:53,781 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:12:53,781 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:12:57,787 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:12:57,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:12:57,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-25 15:12:57,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:12:57,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-25 15:12:57,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-25 15:12:57,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:12:57,808 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-25 15:12:57,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:12:57,923 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-25 15:12:57,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-25 15:12:57,923 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-25 15:12:57,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:12:57,924 INFO L225 Difference]: With dead ends: 69 [2019-02-25 15:12:57,924 INFO L226 Difference]: Without dead ends: 67 [2019-02-25 15:12:57,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-25 15:12:57,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-25 15:12:57,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-25 15:12:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-25 15:12:57,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-25 15:12:57,928 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-25 15:12:57,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:12:57,928 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-25 15:12:57,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-25 15:12:57,929 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-25 15:12:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-25 15:12:57,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:12:57,929 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-25 15:12:57,929 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:12:57,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:12:57,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-25 15:12:57,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:12:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:57,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:12:57,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:12:57,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:12:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:00,213 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:13:00,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:00,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:00,213 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:00,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:00,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:00,213 INFO 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:13:00,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:00,227 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:00,273 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:00,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:00,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-25 15:13:00,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:00,285 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:13:00,286 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:04,621 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:13:04,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:04,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-25 15:13:04,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:04,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-25 15:13:04,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-25 15:13:04,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:13:04,641 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-25 15:13:04,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:04,762 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-25 15:13:04,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-25 15:13:04,764 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-25 15:13:04,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:04,765 INFO L225 Difference]: With dead ends: 70 [2019-02-25 15:13:04,765 INFO L226 Difference]: Without dead ends: 68 [2019-02-25 15:13:04,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-25 15:13:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-25 15:13:04,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-25 15:13:04,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-25 15:13:04,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-25 15:13:04,769 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-25 15:13:04,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:04,769 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-25 15:13:04,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-25 15:13:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-25 15:13:04,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-25 15:13:04,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:04,770 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-25 15:13:04,770 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:04,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:04,771 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-25 15:13:04,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:04,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:04,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:04,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:04,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:06,330 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:13:06,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:06,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:06,331 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:06,331 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:06,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:06,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:13:06,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:06,340 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:06,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-25 15:13:06,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:06,394 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:13:06,394 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:10,986 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:13:11,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:11,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-25 15:13:11,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:11,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-25 15:13:11,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-25 15:13:11,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:13:11,006 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-25 15:13:11,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:11,095 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-25 15:13:11,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-25 15:13:11,095 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-25 15:13:11,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:11,095 INFO L225 Difference]: With dead ends: 71 [2019-02-25 15:13:11,096 INFO L226 Difference]: Without dead ends: 69 [2019-02-25 15:13:11,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-25 15:13:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-25 15:13:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-25 15:13:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-25 15:13:11,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-25 15:13:11,098 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-25 15:13:11,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:11,099 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-25 15:13:11,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-25 15:13:11,099 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-25 15:13:11,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-25 15:13:11,100 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:11,100 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-25 15:13:11,100 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:11,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:11,100 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-25 15:13:11,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:11,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:11,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:11,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:11,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:13,298 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:13:13,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:13,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:13,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:13,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:13,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:13,299 INFO 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:13:13,316 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:13,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:13,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-25 15:13:13,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:13,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-25 15:13:13,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:13,742 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:13:13,742 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:19,791 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:13:19,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:19,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-25 15:13:19,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:19,810 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-25 15:13:19,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-25 15:13:19,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:13:19,811 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-25 15:13:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:19,909 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-25 15:13:19,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-25 15:13:19,909 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-25 15:13:19,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:19,910 INFO L225 Difference]: With dead ends: 72 [2019-02-25 15:13:19,910 INFO L226 Difference]: Without dead ends: 70 [2019-02-25 15:13:19,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-25 15:13:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-25 15:13:19,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-25 15:13:19,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-25 15:13:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-25 15:13:19,912 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-25 15:13:19,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:19,912 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-25 15:13:19,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-25 15:13:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-25 15:13:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-25 15:13:19,913 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:19,913 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-25 15:13:19,913 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:19,913 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-25 15:13:19,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:19,914 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:19,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:19,914 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:21,528 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:13:21,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:21,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:21,529 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:21,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:13:21,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:21,529 INFO 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:13:21,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:21,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:21,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:21,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:21,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-25 15:13:21,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:21,600 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:13:21,600 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:26,452 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:13:26,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:26,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-25 15:13:26,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:26,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-25 15:13:26,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-25 15:13:26,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:13:26,472 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-25 15:13:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:26,762 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-25 15:13:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-25 15:13:26,762 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-25 15:13:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:26,763 INFO L225 Difference]: With dead ends: 73 [2019-02-25 15:13:26,763 INFO L226 Difference]: Without dead ends: 71 [2019-02-25 15:13:26,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-25 15:13:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-25 15:13:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-25 15:13:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-25 15:13:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-25 15:13:26,765 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-25 15:13:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:26,766 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-25 15:13:26,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-25 15:13:26,766 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-25 15:13:26,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-25 15:13:26,766 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:26,767 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-25 15:13:26,767 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:26,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:26,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-25 15:13:26,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:26,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:26,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:26,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:26,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:28,399 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:13:28,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:28,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:28,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:28,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:28,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:28,400 INFO 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:13:28,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:28,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:28,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-25 15:13:28,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:28,470 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:13:28,470 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:33,463 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:13:33,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:33,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-25 15:13:33,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:33,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-25 15:13:33,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-25 15:13:33,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:13:33,483 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-25 15:13:33,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:33,574 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-25 15:13:33,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-25 15:13:33,574 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-25 15:13:33,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:33,575 INFO L225 Difference]: With dead ends: 74 [2019-02-25 15:13:33,575 INFO L226 Difference]: Without dead ends: 72 [2019-02-25 15:13:33,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-25 15:13:33,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-25 15:13:33,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-25 15:13:33,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-25 15:13:33,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-25 15:13:33,578 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-25 15:13:33,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:33,578 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-25 15:13:33,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-25 15:13:33,579 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-25 15:13:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-25 15:13:33,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:33,579 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-25 15:13:33,579 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:33,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-25 15:13:33,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:33,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:33,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:33,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:35,512 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:13:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:35,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:35,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:35,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:35,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:35,512 INFO 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:13:35,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:35,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:35,965 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-25 15:13:35,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:35,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-25 15:13:35,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:35,980 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:13:35,980 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:40,961 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:13:40,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:40,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-25 15:13:40,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:40,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-25 15:13:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-25 15:13:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:13:40,982 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-25 15:13:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:41,163 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-25 15:13:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-25 15:13:41,163 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-25 15:13:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:41,164 INFO L225 Difference]: With dead ends: 75 [2019-02-25 15:13:41,164 INFO L226 Difference]: Without dead ends: 73 [2019-02-25 15:13:41,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-25 15:13:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-25 15:13:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-25 15:13:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-25 15:13:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-25 15:13:41,167 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-25 15:13:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:41,167 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-25 15:13:41,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-25 15:13:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-25 15:13:41,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-25 15:13:41,167 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:41,167 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-25 15:13:41,167 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:41,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:41,168 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-25 15:13:41,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:41,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:41,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:41,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:42,982 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:13:42,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:42,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:42,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:42,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:42,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:42,983 INFO 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:13:42,991 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:13:42,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:13:43,034 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:13:43,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:43,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-25 15:13:43,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:43,046 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:13:43,046 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:48,221 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:13:48,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-25 15:13:48,239 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:48,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-25 15:13:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-25 15:13:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:13:48,240 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-25 15:13:48,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:48,368 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-25 15:13:48,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-25 15:13:48,369 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-25 15:13:48,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:48,369 INFO L225 Difference]: With dead ends: 76 [2019-02-25 15:13:48,369 INFO L226 Difference]: Without dead ends: 74 [2019-02-25 15:13:48,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-25 15:13:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-25 15:13:48,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-25 15:13:48,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-25 15:13:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-25 15:13:48,373 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-25 15:13:48,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:48,374 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-25 15:13:48,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-25 15:13:48,374 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-25 15:13:48,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-25 15:13:48,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:48,375 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-25 15:13:48,375 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:48,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:48,375 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-25 15:13:48,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:48,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:13:48,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:48,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:50,847 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:13:50,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:50,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:50,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:50,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:50,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:50,847 INFO 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:13:50,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:50,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:13:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:50,910 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-25 15:13:50,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:50,921 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:13:50,921 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:13:56,219 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:13:56,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:13:56,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-25 15:13:56,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:13:56,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-25 15:13:56,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-25 15:13:56,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:13:56,239 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-25 15:13:56,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:13:56,378 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-25 15:13:56,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-25 15:13:56,379 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-25 15:13:56,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:13:56,380 INFO L225 Difference]: With dead ends: 77 [2019-02-25 15:13:56,380 INFO L226 Difference]: Without dead ends: 75 [2019-02-25 15:13:56,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-25 15:13:56,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-25 15:13:56,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-25 15:13:56,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-25 15:13:56,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-25 15:13:56,384 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-25 15:13:56,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:13:56,385 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-25 15:13:56,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-25 15:13:56,385 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-25 15:13:56,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-25 15:13:56,385 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:13:56,386 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-25 15:13:56,386 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:13:56,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:13:56,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-25 15:13:56,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:13:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:56,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:13:56,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:13:56,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:13:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:13:58,271 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:13:58,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:58,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:13:58,272 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:13:58,272 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:13:58,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:13:58,272 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:13:58,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:13:58,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:13:58,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-25 15:13:58,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:13:58,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-25 15:13:58,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:13:58,838 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:13:58,838 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:04,456 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:14:04,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:04,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-25 15:14:04,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:04,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-25 15:14:04,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-25 15:14:04,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:14:04,478 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-25 15:14:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:04,644 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-25 15:14:04,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-25 15:14:04,645 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-25 15:14:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:04,645 INFO L225 Difference]: With dead ends: 78 [2019-02-25 15:14:04,646 INFO L226 Difference]: Without dead ends: 76 [2019-02-25 15:14:04,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-25 15:14:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-25 15:14:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-25 15:14:04,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-25 15:14:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-25 15:14:04,649 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-25 15:14:04,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:04,649 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-25 15:14:04,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-25 15:14:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-25 15:14:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-25 15:14:04,650 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:04,650 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-25 15:14:04,650 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-25 15:14:04,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:04,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:04,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:04,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:04,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:06,938 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:14:06,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:06,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:06,939 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:06,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:06,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:06,939 INFO 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:14:06,948 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:06,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:06,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:06,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:06,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-25 15:14:06,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:07,012 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:14:07,013 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:12,662 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:14:12,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:12,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-25 15:14:12,680 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:12,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-25 15:14:12,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-25 15:14:12,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:14:12,682 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-25 15:14:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:12,821 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-25 15:14:12,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-25 15:14:12,822 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-25 15:14:12,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:12,822 INFO L225 Difference]: With dead ends: 79 [2019-02-25 15:14:12,822 INFO L226 Difference]: Without dead ends: 77 [2019-02-25 15:14:12,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-25 15:14:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-25 15:14:12,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-25 15:14:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-25 15:14:12,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-25 15:14:12,825 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-25 15:14:12,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:12,825 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-25 15:14:12,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-25 15:14:12,825 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-25 15:14:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-25 15:14:12,825 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:12,825 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-25 15:14:12,826 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-25 15:14:12,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:12,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:12,827 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:12,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:12,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:14,735 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:14:14,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:14,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:14,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:14,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:14,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:14,735 INFO 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:14:14,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:14,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:14,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-25 15:14:14,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:14,805 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:14:14,805 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:20,673 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:14:20,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:20,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-25 15:14:20,692 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:20,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-25 15:14:20,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-25 15:14:20,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:14:20,693 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-25 15:14:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:20,909 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-25 15:14:20,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-25 15:14:20,909 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-25 15:14:20,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:20,909 INFO L225 Difference]: With dead ends: 80 [2019-02-25 15:14:20,910 INFO L226 Difference]: Without dead ends: 78 [2019-02-25 15:14:20,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-25 15:14:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-25 15:14:20,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-25 15:14:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-25 15:14:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-25 15:14:20,913 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-25 15:14:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:20,913 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-25 15:14:20,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-25 15:14:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-25 15:14:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-25 15:14:20,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:20,914 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-25 15:14:20,915 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:20,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-25 15:14:20,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:20,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:20,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:20,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:23,008 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:14:23,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:23,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:23,008 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:23,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:23,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:23,009 INFO 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:14:23,016 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:23,017 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:23,616 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-25 15:14:23,616 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:23,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-25 15:14:23,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:23,638 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:14:23,639 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:29,634 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:14:29,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:29,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-25 15:14:29,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:29,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-25 15:14:29,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-25 15:14:29,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:14:29,655 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-25 15:14:29,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:29,761 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-25 15:14:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-25 15:14:29,762 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-25 15:14:29,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:29,762 INFO L225 Difference]: With dead ends: 81 [2019-02-25 15:14:29,763 INFO L226 Difference]: Without dead ends: 79 [2019-02-25 15:14:29,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-25 15:14:29,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-25 15:14:29,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-25 15:14:29,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-25 15:14:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-25 15:14:29,767 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-25 15:14:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:29,767 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-25 15:14:29,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-25 15:14:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-25 15:14:29,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-25 15:14:29,768 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:29,768 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-25 15:14:29,768 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-25 15:14:29,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:29,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:29,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:29,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:31,988 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:14:31,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:31,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:31,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:31,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:31,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:31,989 INFO 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:14:31,997 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:14:31,997 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:14:32,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:14:32,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:32,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-25 15:14:32,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:32,064 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:14:32,064 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:38,868 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:14:38,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:38,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-25 15:14:38,886 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:38,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-25 15:14:38,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-25 15:14:38,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:14:38,888 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-25 15:14:38,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:38,999 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-25 15:14:38,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-25 15:14:38,999 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-25 15:14:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:39,000 INFO L225 Difference]: With dead ends: 82 [2019-02-25 15:14:39,000 INFO L226 Difference]: Without dead ends: 80 [2019-02-25 15:14:39,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-25 15:14:39,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-25 15:14:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-25 15:14:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-25 15:14:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-25 15:14:39,004 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-25 15:14:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:39,004 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-25 15:14:39,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-25 15:14:39,005 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-25 15:14:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-25 15:14:39,005 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:39,005 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-25 15:14:39,005 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-25 15:14:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:39,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:39,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:39,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:41,094 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:14:41,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:41,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:41,094 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:41,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:41,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:41,094 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:14:41,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:41,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:14:41,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:41,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-25 15:14:41,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:41,168 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:14:41,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:47,808 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:14:47,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-25 15:14:47,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:47,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-25 15:14:47,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-25 15:14:47,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:14:47,827 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-25 15:14:48,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:48,201 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-25 15:14:48,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-25 15:14:48,201 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-25 15:14:48,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:48,202 INFO L225 Difference]: With dead ends: 83 [2019-02-25 15:14:48,202 INFO L226 Difference]: Without dead ends: 81 [2019-02-25 15:14:48,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-25 15:14:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-25 15:14:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-25 15:14:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-25 15:14:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-25 15:14:48,205 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-25 15:14:48,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:48,205 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-25 15:14:48,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-25 15:14:48,205 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-25 15:14:48,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-25 15:14:48,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:48,206 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-25 15:14:48,206 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:48,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:48,206 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-25 15:14:48,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:48,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:14:48,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:48,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:14:50,322 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:14:50,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:50,322 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:14:50,322 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:14:50,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:14:50,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:14:50,322 INFO 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:14:50,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:14:50,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:14:51,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-25 15:14:51,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:14:51,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-25 15:14:51,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:14:51,080 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:14:51,080 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:14:57,794 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:14:57,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:14:57,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-25 15:14:57,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:14:57,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-25 15:14:57,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-25 15:14:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:14:57,818 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-25 15:14:58,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:14:58,406 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-25 15:14:58,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-25 15:14:58,407 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-25 15:14:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:14:58,407 INFO L225 Difference]: With dead ends: 84 [2019-02-25 15:14:58,408 INFO L226 Difference]: Without dead ends: 82 [2019-02-25 15:14:58,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-25 15:14:58,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-25 15:14:58,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-25 15:14:58,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-25 15:14:58,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-25 15:14:58,411 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-25 15:14:58,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:14:58,411 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-25 15:14:58,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-25 15:14:58,411 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-25 15:14:58,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-25 15:14:58,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:14:58,412 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-25 15:14:58,412 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:14:58,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:14:58,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-25 15:14:58,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:14:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:58,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:14:58,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:14:58,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:14:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:01,046 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:15:01,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:01,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:01,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:01,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:01,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:01,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:01,055 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:01,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:01,111 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:01,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:01,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-25 15:15:01,115 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:01,135 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:15:01,135 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:08,267 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:15:08,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:08,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-25 15:15:08,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:08,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-25 15:15:08,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-25 15:15:08,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:15:08,288 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-25 15:15:08,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:08,441 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-25 15:15:08,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-25 15:15:08,442 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-25 15:15:08,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:08,443 INFO L225 Difference]: With dead ends: 85 [2019-02-25 15:15:08,443 INFO L226 Difference]: Without dead ends: 83 [2019-02-25 15:15:08,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-25 15:15:08,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-25 15:15:08,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-25 15:15:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-25 15:15:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-25 15:15:08,446 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-25 15:15:08,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:08,446 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-25 15:15:08,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-25 15:15:08,446 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-25 15:15:08,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-25 15:15:08,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:08,446 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-25 15:15:08,447 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:08,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:08,447 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-25 15:15:08,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:08,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:08,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:08,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:08,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:10,738 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:15:10,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:10,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:10,738 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:10,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:10,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:10,738 INFO 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:15:10,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:10,747 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:10,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:10,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-25 15:15:10,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:10,814 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:15:10,814 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:17,925 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:15:17,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:17,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-25 15:15:17,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:17,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-25 15:15:17,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-25 15:15:17,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:15:17,945 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-25 15:15:18,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:18,064 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-25 15:15:18,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-25 15:15:18,065 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-25 15:15:18,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:18,066 INFO L225 Difference]: With dead ends: 86 [2019-02-25 15:15:18,066 INFO L226 Difference]: Without dead ends: 84 [2019-02-25 15:15:18,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-25 15:15:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-25 15:15:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-25 15:15:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-25 15:15:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-25 15:15:18,069 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-25 15:15:18,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:18,069 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-25 15:15:18,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-25 15:15:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-25 15:15:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-25 15:15:18,070 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:18,070 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-25 15:15:18,070 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-25 15:15:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:18,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:18,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:20,601 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:15:20,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:20,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:20,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:20,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:20,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:20,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:20,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:20,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:21,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-25 15:15:21,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:21,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-25 15:15:21,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:21,424 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:15:21,425 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:28,565 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:15:28,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:28,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-25 15:15:28,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:28,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-25 15:15:28,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-25 15:15:28,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:15:28,587 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-25 15:15:28,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:28,763 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-25 15:15:28,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-25 15:15:28,763 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-25 15:15:28,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:28,763 INFO L225 Difference]: With dead ends: 87 [2019-02-25 15:15:28,764 INFO L226 Difference]: Without dead ends: 85 [2019-02-25 15:15:28,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-25 15:15:28,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-25 15:15:28,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-25 15:15:28,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-25 15:15:28,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-25 15:15:28,767 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-25 15:15:28,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:28,767 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-25 15:15:28,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-25 15:15:28,767 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-25 15:15:28,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-25 15:15:28,767 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:28,768 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-25 15:15:28,768 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:28,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:28,768 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-25 15:15:28,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:28,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:28,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:28,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:28,769 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:28,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:31,217 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:15:31,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:31,217 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:31,217 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:31,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:15:31,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:31,218 INFO 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:15:31,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:15:31,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:15:31,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:15:31,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:31,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-25 15:15:31,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:31,293 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:15:31,293 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:38,789 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:15:38,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:38,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-25 15:15:38,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:38,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-25 15:15:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-25 15:15:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:15:38,809 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-25 15:15:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:38,981 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-25 15:15:38,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-25 15:15:38,982 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-25 15:15:38,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:38,982 INFO L225 Difference]: With dead ends: 88 [2019-02-25 15:15:38,982 INFO L226 Difference]: Without dead ends: 86 [2019-02-25 15:15:38,983 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-25 15:15:38,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-25 15:15:38,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-25 15:15:38,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-25 15:15:38,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-25 15:15:38,985 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-25 15:15:38,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:38,985 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-25 15:15:38,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-25 15:15:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-25 15:15:38,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-25 15:15:38,986 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:38,986 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-25 15:15:38,986 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:38,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-25 15:15:38,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:38,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:38,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:15:38,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:38,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:41,481 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:15:41,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:41,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:41,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:41,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:41,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:41,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:41,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:41,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:15:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:41,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-25 15:15:41,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:41,561 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:15:41,562 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:15:48,896 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:15:48,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:15:48,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-25 15:15:48,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:15:48,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-25 15:15:48,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-25 15:15:48,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:15:48,916 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-25 15:15:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:15:49,129 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-25 15:15:49,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-25 15:15:49,129 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-25 15:15:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:15:49,130 INFO L225 Difference]: With dead ends: 89 [2019-02-25 15:15:49,130 INFO L226 Difference]: Without dead ends: 87 [2019-02-25 15:15:49,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-25 15:15:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-25 15:15:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-25 15:15:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-25 15:15:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-25 15:15:49,133 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-25 15:15:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:15:49,133 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-25 15:15:49,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-25 15:15:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-25 15:15:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-25 15:15:49,133 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:15:49,133 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-25 15:15:49,134 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:15:49,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:15:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-25 15:15:49,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:15:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:49,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:15:49,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:15:49,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:15:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:15:51,632 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:15:51,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:51,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:15:51,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:15:51,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:15:51,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:15:51,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:15:51,641 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:15:51,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:15:52,568 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-25 15:15:52,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:15:52,573 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-25 15:15:52,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:15:52,587 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:15:52,587 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:00,291 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:16:00,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:00,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-25 15:16:00,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:00,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-25 15:16:00,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-25 15:16:00,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:16:00,313 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-25 15:16:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:00,478 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-25 15:16:00,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-25 15:16:00,479 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-25 15:16:00,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:00,479 INFO L225 Difference]: With dead ends: 90 [2019-02-25 15:16:00,479 INFO L226 Difference]: Without dead ends: 88 [2019-02-25 15:16:00,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-25 15:16:00,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-25 15:16:00,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-25 15:16:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-25 15:16:00,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-25 15:16:00,483 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-25 15:16:00,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:00,483 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-25 15:16:00,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-25 15:16:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-25 15:16:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-25 15:16:00,484 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:00,484 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-25 15:16:00,484 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:00,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:00,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-25 15:16:00,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:00,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:00,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:00,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:03,016 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:16:03,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:03,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:03,016 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:03,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:03,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:03,016 INFO 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:16:03,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:03,024 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:03,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:03,076 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:03,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-25 15:16:03,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:03,091 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:16:03,092 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:11,055 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:16:11,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:11,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-25 15:16:11,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:11,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-25 15:16:11,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-25 15:16:11,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:16:11,075 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-25 15:16:11,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:11,227 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-25 15:16:11,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-25 15:16:11,227 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-25 15:16:11,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:11,228 INFO L225 Difference]: With dead ends: 91 [2019-02-25 15:16:11,228 INFO L226 Difference]: Without dead ends: 89 [2019-02-25 15:16:11,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-25 15:16:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-25 15:16:11,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-25 15:16:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-25 15:16:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-25 15:16:11,231 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-25 15:16:11,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:11,232 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-25 15:16:11,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-25 15:16:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-25 15:16:11,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-25 15:16:11,232 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:11,233 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-25 15:16:11,233 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:11,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:11,233 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-25 15:16:11,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:11,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:11,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:11,234 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:14,124 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:16:14,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:14,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:14,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:14,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:14,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:14,125 INFO 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:16:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:14,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:14,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-25 15:16:14,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:14,202 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:16:14,202 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:22,011 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:16:22,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:22,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-25 15:16:22,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:22,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-25 15:16:22,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-25 15:16:22,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:16:22,032 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-25 15:16:22,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:22,241 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-25 15:16:22,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-25 15:16:22,241 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-25 15:16:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:22,242 INFO L225 Difference]: With dead ends: 92 [2019-02-25 15:16:22,242 INFO L226 Difference]: Without dead ends: 90 [2019-02-25 15:16:22,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-25 15:16:22,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-25 15:16:22,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-25 15:16:22,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-25 15:16:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-25 15:16:22,245 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-25 15:16:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:22,246 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-25 15:16:22,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-25 15:16:22,246 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-25 15:16:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-25 15:16:22,246 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:22,246 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-25 15:16:22,246 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:22,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-25 15:16:22,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:22,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:22,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:22,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:25,315 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:16:25,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:25,315 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:25,315 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:25,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:25,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:25,316 INFO 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:16:25,324 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:16:25,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:16:26,391 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-25 15:16:26,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:26,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-25 15:16:26,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:26,412 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:16:26,412 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:34,539 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:16:34,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:34,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-25 15:16:34,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:34,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-25 15:16:34,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-25 15:16:34,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:16:34,561 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-25 15:16:34,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:34,765 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-25 15:16:34,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-25 15:16:34,765 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-25 15:16:34,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:34,765 INFO L225 Difference]: With dead ends: 93 [2019-02-25 15:16:34,765 INFO L226 Difference]: Without dead ends: 91 [2019-02-25 15:16:34,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-25 15:16:34,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-25 15:16:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-25 15:16:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-25 15:16:34,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-25 15:16:34,768 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-25 15:16:34,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:34,768 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-25 15:16:34,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-25 15:16:34,768 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-25 15:16:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-25 15:16:34,769 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:34,769 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-25 15:16:34,769 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:34,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:34,769 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-25 15:16:34,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:34,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:34,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:34,770 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:37,499 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:16:37,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:37,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:37,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:37,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:37,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:37,500 INFO 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:16:37,518 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:16:37,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:16:37,572 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:16:37,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:16:37,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-25 15:16:37,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:37,588 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:16:37,589 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:45,781 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:16:45,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:45,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-25 15:16:45,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:45,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-25 15:16:45,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-25 15:16:45,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:16:45,801 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-25 15:16:45,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:45,926 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-25 15:16:45,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-25 15:16:45,927 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-25 15:16:45,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:45,927 INFO L225 Difference]: With dead ends: 94 [2019-02-25 15:16:45,927 INFO L226 Difference]: Without dead ends: 92 [2019-02-25 15:16:45,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-25 15:16:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-25 15:16:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-25 15:16:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-25 15:16:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-25 15:16:45,930 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-25 15:16:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:45,930 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-25 15:16:45,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-25 15:16:45,930 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-25 15:16:45,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-25 15:16:45,931 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:45,931 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-25 15:16:45,931 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:45,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:45,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-25 15:16:45,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:45,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:45,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:16:45,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:45,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:48,751 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:16:48,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:48,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:16:48,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:16:48,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:16:48,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:16:48,752 INFO 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:16:48,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:48,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:16:48,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:16:48,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-25 15:16:48,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:16:48,827 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:16:48,827 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:16:57,210 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:16:57,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:16:57,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-25 15:16:57,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:16:57,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-25 15:16:57,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-25 15:16:57,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:16:57,232 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-25 15:16:57,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:16:57,447 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-25 15:16:57,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-25 15:16:57,448 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-25 15:16:57,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:16:57,448 INFO L225 Difference]: With dead ends: 95 [2019-02-25 15:16:57,448 INFO L226 Difference]: Without dead ends: 93 [2019-02-25 15:16:57,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-25 15:16:57,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-25 15:16:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-25 15:16:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-25 15:16:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-25 15:16:57,451 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-25 15:16:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:16:57,451 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-25 15:16:57,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-25 15:16:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-25 15:16:57,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-25 15:16:57,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:16:57,452 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-25 15:16:57,452 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:16:57,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:16:57,452 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-25 15:16:57,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:16:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:57,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:16:57,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:16:57,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:16:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:00,605 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:17:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:00,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:00,606 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:00,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:00,606 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:00,614 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:00,614 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:01,815 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-25 15:17:01,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:01,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-25 15:17:01,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:01,836 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:17:01,836 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:10,550 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:17:10,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:10,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-25 15:17:10,572 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:10,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-25 15:17:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-25 15:17:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:17:10,573 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-25 15:17:10,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:10,717 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-25 15:17:10,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-25 15:17:10,718 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-25 15:17:10,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:10,719 INFO L225 Difference]: With dead ends: 96 [2019-02-25 15:17:10,719 INFO L226 Difference]: Without dead ends: 94 [2019-02-25 15:17:10,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-25 15:17:10,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-25 15:17:10,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-25 15:17:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-25 15:17:10,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-25 15:17:10,721 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-25 15:17:10,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:10,722 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-25 15:17:10,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-25 15:17:10,722 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-25 15:17:10,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-25 15:17:10,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:10,722 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-25 15:17:10,722 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-25 15:17:10,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:10,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:10,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:10,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:10,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:13,609 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:17:13,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:13,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:13,610 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:13,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:13,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:13,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:17:13,618 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:13,618 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:13,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:13,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:13,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-25 15:17:13,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:13,693 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:17:13,693 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:22,692 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:17:22,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:22,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-25 15:17:22,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:22,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-25 15:17:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-25 15:17:22,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:17:22,713 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-25 15:17:22,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:22,943 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-25 15:17:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-25 15:17:22,943 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-25 15:17:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:22,944 INFO L225 Difference]: With dead ends: 97 [2019-02-25 15:17:22,944 INFO L226 Difference]: Without dead ends: 95 [2019-02-25 15:17:22,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-25 15:17:22,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-25 15:17:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-25 15:17:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-25 15:17:22,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-25 15:17:22,948 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-25 15:17:22,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:22,948 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-25 15:17:22,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-25 15:17:22,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-25 15:17:22,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-25 15:17:22,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:22,949 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-25 15:17:22,949 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:22,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:22,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-25 15:17:22,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:22,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:22,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:22,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:26,151 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:17:26,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:26,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:26,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:26,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:26,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:26,152 INFO 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:17:26,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:26,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:17:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:26,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-25 15:17:26,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:26,232 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:17:26,232 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:35,060 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:17:35,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:35,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-25 15:17:35,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:35,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-25 15:17:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-25 15:17:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:17:35,080 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-25 15:17:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:35,260 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-25 15:17:35,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-25 15:17:35,261 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-25 15:17:35,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:35,261 INFO L225 Difference]: With dead ends: 98 [2019-02-25 15:17:35,261 INFO L226 Difference]: Without dead ends: 96 [2019-02-25 15:17:35,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-25 15:17:35,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-25 15:17:35,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-25 15:17:35,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-25 15:17:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-25 15:17:35,265 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-25 15:17:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:35,265 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-25 15:17:35,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-25 15:17:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-25 15:17:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-25 15:17:35,266 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:35,266 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-25 15:17:35,266 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:35,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:35,266 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-25 15:17:35,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:35,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:35,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:17:35,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:35,267 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:38,498 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:17:38,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:38,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:38,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:38,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:38,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:38,499 INFO 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:17:38,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:17:38,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:17:39,816 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-25 15:17:39,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:39,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-25 15:17:39,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:39,836 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:17:39,837 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:17:49,099 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:17:49,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:17:49,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-25 15:17:49,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:17:49,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-25 15:17:49,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-25 15:17:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:17:49,122 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-25 15:17:49,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:17:49,271 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-25 15:17:49,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-25 15:17:49,271 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-25 15:17:49,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:17:49,272 INFO L225 Difference]: With dead ends: 99 [2019-02-25 15:17:49,272 INFO L226 Difference]: Without dead ends: 97 [2019-02-25 15:17:49,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-25 15:17:49,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-25 15:17:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-25 15:17:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-25 15:17:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-25 15:17:49,276 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-25 15:17:49,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:17:49,276 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-25 15:17:49,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-25 15:17:49,276 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-25 15:17:49,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-25 15:17:49,277 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:17:49,277 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-25 15:17:49,277 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:17:49,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:17:49,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-25 15:17:49,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:17:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:49,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:17:49,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:17:49,278 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:17:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:17:52,791 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:17:52,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:52,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:17:52,791 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:17:52,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:17:52,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:17:52,792 INFO 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:17:52,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:17:52,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:17:52,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:17:52,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:17:52,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-25 15:17:52,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:17:52,879 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:17:52,879 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:02,483 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:18:02,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:02,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-25 15:18:02,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:02,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-25 15:18:02,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-25 15:18:02,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:18:02,504 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-25 15:18:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:02,651 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-25 15:18:02,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-25 15:18:02,652 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-25 15:18:02,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:02,653 INFO L225 Difference]: With dead ends: 100 [2019-02-25 15:18:02,653 INFO L226 Difference]: Without dead ends: 98 [2019-02-25 15:18:02,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-25 15:18:02,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-25 15:18:02,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-25 15:18:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-25 15:18:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-25 15:18:02,657 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-25 15:18:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:02,657 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-25 15:18:02,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-25 15:18:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-25 15:18:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-25 15:18:02,658 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:02,658 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-25 15:18:02,658 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:02,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:02,658 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-25 15:18:02,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:02,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:02,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:02,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:05,928 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:18:05,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:05,928 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:05,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:05,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:05,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:05,929 INFO 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:18:05,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:05,939 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:05,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:05,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-25 15:18:05,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:06,014 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:18:06,014 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:15,477 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:18:15,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:15,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-25 15:18:15,495 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:15,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-25 15:18:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-25 15:18:15,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:18:15,497 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-25 15:18:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:15,650 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-25 15:18:15,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-25 15:18:15,651 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-25 15:18:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:15,651 INFO L225 Difference]: With dead ends: 101 [2019-02-25 15:18:15,651 INFO L226 Difference]: Without dead ends: 99 [2019-02-25 15:18:15,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-25 15:18:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-25 15:18:15,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-25 15:18:15,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-25 15:18:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-25 15:18:15,654 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-25 15:18:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:15,655 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-25 15:18:15,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-25 15:18:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-25 15:18:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-25 15:18:15,655 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:15,655 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-25 15:18:15,656 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-25 15:18:15,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:15,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:15,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:15,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:19,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:19,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:19,177 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:19,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:19,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:19,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:19,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:18:19,187 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:18:20,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-25 15:18:20,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:20,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-25 15:18:20,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:20,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:30,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:30,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:30,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-25 15:18:30,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:30,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-25 15:18:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-25 15:18:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:18:30,564 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-25 15:18:30,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:30,736 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-25 15:18:30,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-25 15:18:30,736 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-25 15:18:30,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:30,737 INFO L225 Difference]: With dead ends: 102 [2019-02-25 15:18:30,737 INFO L226 Difference]: Without dead ends: 100 [2019-02-25 15:18:30,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-25 15:18:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-25 15:18:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-25 15:18:30,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-25 15:18:30,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-25 15:18:30,741 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-25 15:18:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:30,741 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-25 15:18:30,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-25 15:18:30,742 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-25 15:18:30,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-25 15:18:30,742 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:30,742 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-25 15:18:30,742 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:30,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:30,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-25 15:18:30,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:30,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:30,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:30,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:30,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:34,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:34,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:34,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:34,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:34,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:34,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:34,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:18:34,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:18:34,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:18:34,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:18:34,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-25 15:18:34,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:34,476 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:44,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:44,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:44,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-25 15:18:44,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:44,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-25 15:18:44,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-25 15:18:44,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:18:44,594 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-25 15:18:44,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:44,795 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-25 15:18:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-25 15:18:44,795 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-25 15:18:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:44,796 INFO L225 Difference]: With dead ends: 103 [2019-02-25 15:18:44,796 INFO L226 Difference]: Without dead ends: 101 [2019-02-25 15:18:44,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-25 15:18:44,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-25 15:18:44,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-25 15:18:44,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-25 15:18:44,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-25 15:18:44,800 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-25 15:18:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:44,800 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-25 15:18:44,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-25 15:18:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-25 15:18:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-25 15:18:44,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:44,801 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-25 15:18:44,801 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:44,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:44,801 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-25 15:18:44,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:44,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:44,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:18:44,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:44,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:44,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:48,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:48,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:48,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:18:48,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:18:48,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:18:48,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:18:48,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:18:48,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:48,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:18:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:18:48,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-25 15:18:48,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:18:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:48,507 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:18:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:18:58,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:18:58,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-25 15:18:58,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:18:58,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-25 15:18:58,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-25 15:18:58,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:18:58,566 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-25 15:18:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:18:58,854 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-25 15:18:58,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-25 15:18:58,855 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-25 15:18:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:18:58,855 INFO L225 Difference]: With dead ends: 104 [2019-02-25 15:18:58,855 INFO L226 Difference]: Without dead ends: 102 [2019-02-25 15:18:58,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-25 15:18:58,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-25 15:18:58,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-25 15:18:58,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-25 15:18:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-25 15:18:58,860 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-25 15:18:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:18:58,860 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-25 15:18:58,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-25 15:18:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-25 15:18:58,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-25 15:18:58,861 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:18:58,861 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-25 15:18:58,861 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:18:58,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:18:58,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-25 15:18:58,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:18:58,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:58,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:18:58,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:18:58,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:18:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:02,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:02,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:02,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:02,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:02,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:02,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:02,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:02,533 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:02,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:04,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-25 15:19:04,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:04,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-25 15:19:04,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:04,197 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:04,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:14,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:14,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:14,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-25 15:19:14,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:14,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-25 15:19:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-25 15:19:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:19:14,419 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-25 15:19:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:14,657 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-25 15:19:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-25 15:19:14,658 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-25 15:19:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:14,658 INFO L225 Difference]: With dead ends: 105 [2019-02-25 15:19:14,658 INFO L226 Difference]: Without dead ends: 103 [2019-02-25 15:19:14,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-25 15:19:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-25 15:19:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-25 15:19:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-25 15:19:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-25 15:19:14,662 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-25 15:19:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:14,662 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-25 15:19:14,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-25 15:19:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-25 15:19:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-25 15:19:14,663 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:14,663 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-25 15:19:14,663 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:14,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:14,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-25 15:19:14,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:14,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:14,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:14,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:14,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:18,517 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:18,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:18,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:18,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:18,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:18,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:18,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:18,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:19:18,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:19:18,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:19:18,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:18,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-25 15:19:18,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:18,604 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:18,604 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:29,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:29,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-25 15:19:29,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:29,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-25 15:19:29,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-25 15:19:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:19:29,042 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-25 15:19:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:29,308 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-25 15:19:29,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-25 15:19:29,308 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-25 15:19:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:29,309 INFO L225 Difference]: With dead ends: 106 [2019-02-25 15:19:29,309 INFO L226 Difference]: Without dead ends: 104 [2019-02-25 15:19:29,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-25 15:19:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-25 15:19:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-25 15:19:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-25 15:19:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-25 15:19:29,313 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-25 15:19:29,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:29,313 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-25 15:19:29,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-25 15:19:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-25 15:19:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-25 15:19:29,314 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:29,314 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-25 15:19:29,314 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:29,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:29,314 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-25 15:19:29,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:29,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:19:29,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:29,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:32,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:32,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:32,934 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:32,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:32,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:32,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:32,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:32,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:19:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:33,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-25 15:19:33,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:33,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:33,022 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:19:44,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:44,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:19:44,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-25 15:19:44,129 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:19:44,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-25 15:19:44,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-25 15:19:44,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:19:44,132 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-25 15:19:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:19:44,309 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-25 15:19:44,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-25 15:19:44,309 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-25 15:19:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:19:44,310 INFO L225 Difference]: With dead ends: 107 [2019-02-25 15:19:44,311 INFO L226 Difference]: Without dead ends: 105 [2019-02-25 15:19:44,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-25 15:19:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-25 15:19:44,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-25 15:19:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-25 15:19:44,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-25 15:19:44,315 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-25 15:19:44,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:19:44,315 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-25 15:19:44,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-25 15:19:44,315 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-25 15:19:44,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-25 15:19:44,316 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:19:44,316 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-25 15:19:44,316 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:19:44,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:19:44,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-25 15:19:44,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:19:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:44,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:19:44,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:19:44,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:19:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:19:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:47,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:47,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:19:47,887 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:19:47,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:19:47,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:19:47,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:19:47,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:19:47,897 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:19:49,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-25 15:19:49,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:19:49,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-25 15:19:49,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:19:49,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:19:49,854 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:00,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:00,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-25 15:20:00,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:00,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-25 15:20:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-25 15:20:00,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:20:00,838 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-25 15:20:01,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:01,165 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-25 15:20:01,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-25 15:20:01,173 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-25 15:20:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:01,174 INFO L225 Difference]: With dead ends: 108 [2019-02-25 15:20:01,174 INFO L226 Difference]: Without dead ends: 106 [2019-02-25 15:20:01,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-25 15:20:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-25 15:20:01,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-25 15:20:01,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-25 15:20:01,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-25 15:20:01,178 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-25 15:20:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:01,179 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-25 15:20:01,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-25 15:20:01,179 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-25 15:20:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-25 15:20:01,179 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:01,180 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-25 15:20:01,180 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:01,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-25 15:20:01,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:01,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:01,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:01,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:05,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:05,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:05,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:05,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:05,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:20:05,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:05,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:05,230 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:05,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:05,291 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:05,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:05,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-25 15:20:05,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:05,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:05,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:16,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:16,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:16,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-25 15:20:16,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:16,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-25 15:20:16,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-25 15:20:16,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:20:16,733 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-25 15:20:17,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:17,013 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-25 15:20:17,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-25 15:20:17,014 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-25 15:20:17,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:17,014 INFO L225 Difference]: With dead ends: 109 [2019-02-25 15:20:17,014 INFO L226 Difference]: Without dead ends: 107 [2019-02-25 15:20:17,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-25 15:20:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-25 15:20:17,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-25 15:20:17,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-25 15:20:17,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-25 15:20:17,018 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-25 15:20:17,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:17,018 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-25 15:20:17,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-25 15:20:17,019 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-25 15:20:17,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-25 15:20:17,019 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:17,019 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-25 15:20:17,020 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:17,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:17,020 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-25 15:20:17,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:17,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:17,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:17,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:21,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:21,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:21,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:21,001 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:21,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:21,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:21,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:21,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:20:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:21,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-25 15:20:21,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:21,097 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:21,097 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:32,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:32,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-25 15:20:32,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:32,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-25 15:20:32,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-25 15:20:32,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:20:32,728 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-25 15:20:32,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:32,963 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-25 15:20:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-25 15:20:32,963 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-25 15:20:32,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:32,963 INFO L225 Difference]: With dead ends: 110 [2019-02-25 15:20:32,963 INFO L226 Difference]: Without dead ends: 108 [2019-02-25 15:20:32,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-25 15:20:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-25 15:20:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-25 15:20:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-25 15:20:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-25 15:20:32,967 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-25 15:20:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:32,967 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-25 15:20:32,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-25 15:20:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-25 15:20:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-25 15:20:32,967 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:32,967 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-25 15:20:32,968 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-25 15:20:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:32,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:20:32,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:32,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:37,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:37,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:37,109 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:37,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:37,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:37,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:37,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:20:37,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:20:39,211 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-25 15:20:39,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:39,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-25 15:20:39,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:39,240 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:20:51,124 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:51,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:20:51,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-25 15:20:51,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:20:51,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-25 15:20:51,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-25 15:20:51,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:20:51,148 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-25 15:20:51,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:20:51,377 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-25 15:20:51,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-25 15:20:51,378 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-25 15:20:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:20:51,378 INFO L225 Difference]: With dead ends: 111 [2019-02-25 15:20:51,378 INFO L226 Difference]: Without dead ends: 109 [2019-02-25 15:20:51,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-25 15:20:51,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-25 15:20:51,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-25 15:20:51,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-25 15:20:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-25 15:20:51,382 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-25 15:20:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:20:51,382 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-25 15:20:51,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-25 15:20:51,383 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-25 15:20:51,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-25 15:20:51,383 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:20:51,384 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-25 15:20:51,384 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:20:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:20:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-25 15:20:51,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:20:51,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:51,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:20:51,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:20:51,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:20:51,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:20:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:55,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:20:55,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:20:55,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:20:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:20:55,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:20:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:20:55,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:20:55,556 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:20:55,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:20:55,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-25 15:20:55,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:20:55,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:20:55,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:07,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:07,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:07,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-25 15:21:07,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:07,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-25 15:21:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-25 15:21:07,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-25 15:21:07,457 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-25 15:21:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:07,702 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-25 15:21:07,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-25 15:21:07,703 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-25 15:21:07,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:07,703 INFO L225 Difference]: With dead ends: 112 [2019-02-25 15:21:07,703 INFO L226 Difference]: Without dead ends: 110 [2019-02-25 15:21:07,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-25 15:21:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-25 15:21:07,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-25 15:21:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-25 15:21:07,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-25 15:21:07,707 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-25 15:21:07,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:07,707 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-25 15:21:07,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-25 15:21:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-25 15:21:07,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-25 15:21:07,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:07,708 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-25 15:21:07,708 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:07,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:07,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-25 15:21:07,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:07,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:07,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:11,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:11,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:11,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:11,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:11,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:11,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:11,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:11,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:21:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:11,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 108 conjunts are in the unsatisfiable core [2019-02-25 15:21:11,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:11,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:11,887 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:24,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:24,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-25 15:21:24,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:24,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-25 15:21:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-25 15:21:24,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-25 15:21:24,155 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-25 15:21:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:24,475 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-25 15:21:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-25 15:21:24,476 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-25 15:21:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:24,476 INFO L225 Difference]: With dead ends: 113 [2019-02-25 15:21:24,476 INFO L226 Difference]: Without dead ends: 111 [2019-02-25 15:21:24,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-25 15:21:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-25 15:21:24,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-25 15:21:24,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-25 15:21:24,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-25 15:21:24,480 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-25 15:21:24,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:24,480 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-25 15:21:24,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-25 15:21:24,480 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-25 15:21:24,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-25 15:21:24,481 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:24,481 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-25 15:21:24,481 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:24,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:24,481 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-25 15:21:24,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:24,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:24,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:21:24,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:24,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:28,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:28,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:28,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:28,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:28,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:28,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:28,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:28,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:21:28,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:21:31,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-25 15:21:31,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:31,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-25 15:21:31,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:31,060 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:21:43,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:43,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:21:43,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-25 15:21:43,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:21:43,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-25 15:21:43,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-25 15:21:43,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-25 15:21:43,367 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-25 15:21:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:21:43,696 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-25 15:21:43,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-25 15:21:43,696 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-25 15:21:43,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:21:43,697 INFO L225 Difference]: With dead ends: 114 [2019-02-25 15:21:43,697 INFO L226 Difference]: Without dead ends: 112 [2019-02-25 15:21:43,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-25 15:21:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-25 15:21:43,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-25 15:21:43,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-25 15:21:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-25 15:21:43,700 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-25 15:21:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:21:43,700 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-25 15:21:43,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-25 15:21:43,700 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-25 15:21:43,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-25 15:21:43,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:21:43,701 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-25 15:21:43,701 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:21:43,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:21:43,701 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-25 15:21:43,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:21:43,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:43,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:21:43,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:21:43,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:21:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:21:48,012 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:48,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:48,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:21:48,013 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:21:48,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:21:48,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:21:48,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:21:48,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:21:48,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:21:48,078 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:21:48,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:21:48,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-25 15:21:48,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:21:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:21:48,101 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:00,691 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:00,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:00,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-25 15:22:00,709 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:00,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-25 15:22:00,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-25 15:22:00,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-25 15:22:00,713 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-25 15:22:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:00,987 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-25 15:22:00,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-25 15:22:00,987 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-25 15:22:00,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:00,988 INFO L225 Difference]: With dead ends: 115 [2019-02-25 15:22:00,988 INFO L226 Difference]: Without dead ends: 113 [2019-02-25 15:22:00,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-25 15:22:00,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-25 15:22:00,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-25 15:22:00,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-25 15:22:00,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-25 15:22:00,994 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-25 15:22:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:00,994 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-25 15:22:00,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-25 15:22:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-25 15:22:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-25 15:22:00,995 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:00,995 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-25 15:22:00,995 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:00,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-25 15:22:00,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:00,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:00,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:00,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:00,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:05,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:05,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:05,542 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:05,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:05,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:05,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:05,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:05,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-25 15:22:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:05,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-25 15:22:05,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:05,641 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:18,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:18,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-25 15:22:18,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:18,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-25 15:22:18,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-25 15:22:18,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-25 15:22:18,552 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-25 15:22:18,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:18,778 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-25 15:22:18,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-25 15:22:18,778 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-25 15:22:18,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:18,779 INFO L225 Difference]: With dead ends: 116 [2019-02-25 15:22:18,779 INFO L226 Difference]: Without dead ends: 114 [2019-02-25 15:22:18,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-25 15:22:18,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-25 15:22:18,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-25 15:22:18,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-25 15:22:18,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-25 15:22:18,784 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-25 15:22:18,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:18,784 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-25 15:22:18,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-25 15:22:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-25 15:22:18,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-25 15:22:18,785 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:18,785 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-25 15:22:18,785 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:18,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:18,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-25 15:22:18,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:18,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-25 15:22:18,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:18,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:23,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:23,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:23,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:23,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:23,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:23,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-25 15:22:23,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-25 15:22:26,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-25 15:22:26,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:26,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-25 15:22:26,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:26,176 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-25 15:22:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:39,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-25 15:22:39,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-02-25 15:22:39,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-25 15:22:39,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-25 15:22:39,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-25 15:22:39,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-25 15:22:39,389 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-02-25 15:22:39,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-25 15:22:39,750 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-25 15:22:39,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-25 15:22:39,750 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-02-25 15:22:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-25 15:22:39,750 INFO L225 Difference]: With dead ends: 117 [2019-02-25 15:22:39,751 INFO L226 Difference]: Without dead ends: 115 [2019-02-25 15:22:39,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-25 15:22:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-25 15:22:39,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-25 15:22:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-25 15:22:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-25 15:22:39,755 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-02-25 15:22:39,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-25 15:22:39,756 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-25 15:22:39,756 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-25 15:22:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-25 15:22:39,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-25 15:22:39,756 INFO L394 BasicCegarLoop]: Found error trace [2019-02-25 15:22:39,756 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-02-25 15:22:39,757 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-25 15:22:39,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-25 15:22:39,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-02-25 15:22:39,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-25 15:22:39,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:39,758 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-25 15:22:39,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-25 15:22:39,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-25 15:22:39,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-25 15:22:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:44,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:44,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-25 15:22:44,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-25 15:22:44,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-25 15:22:44,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-25 15:22:44,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-25 15:22:44,303 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-25 15:22:44,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-25 15:22:44,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-25 15:22:44,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-25 15:22:44,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 113 conjunts are in the unsatisfiable core [2019-02-25 15:22:44,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-25 15:22:44,391 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-25 15:22:44,391 INFO L322 TraceCheckSpWp]: Computing backward predicates...