java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 12:00:07,067 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 12:00:07,069 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 12:00:07,088 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 12:00:07,088 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 12:00:07,090 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 12:00:07,091 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 12:00:07,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 12:00:07,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 12:00:07,097 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 12:00:07,105 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 12:00:07,105 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 12:00:07,106 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 12:00:07,110 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 12:00:07,111 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 12:00:07,112 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 12:00:07,113 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 12:00:07,118 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 12:00:07,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 12:00:07,123 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 12:00:07,125 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 12:00:07,127 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 12:00:07,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 12:00:07,132 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 12:00:07,132 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 12:00:07,133 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 12:00:07,134 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 12:00:07,134 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 12:00:07,135 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 12:00:07,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 12:00:07,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 12:00:07,141 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 12:00:07,142 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 12:00:07,142 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 12:00:07,143 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 12:00:07,144 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 12:00:07,144 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-04 12:00:07,157 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 12:00:07,157 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 12:00:07,158 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 12:00:07,158 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 12:00:07,158 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 12:00:07,159 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 12:00:07,159 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 12:00:07,159 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 12:00:07,159 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 12:00:07,159 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-04 12:00:07,160 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-04 12:00:07,160 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 12:00:07,160 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 12:00:07,160 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 12:00:07,161 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 12:00:07,161 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 12:00:07,161 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 12:00:07,161 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 12:00:07,162 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 12:00:07,162 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 12:00:07,162 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 12:00:07,162 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 12:00:07,162 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 12:00:07,163 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 12:00:07,163 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 12:00:07,163 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 12:00:07,163 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 12:00:07,163 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 12:00:07,165 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 12:00:07,165 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 12:00:07,165 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 12:00:07,165 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 12:00:07,166 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 12:00:07,166 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 12:00:07,166 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 12:00:07,166 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 12:00:07,166 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 12:00:07,167 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 12:00:07,167 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 12:00:07,167 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 12:00:07,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 12:00:07,224 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 12:00:07,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 12:00:07,230 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 12:00:07,231 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 12:00:07,232 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2018-12-04 12:00:07,232 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2018-12-04 12:00:07,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 12:00:07,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 12:00:07,275 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 12:00:07,275 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 12:00:07,276 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 12:00:07,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,307 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 12:00:07,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 12:00:07,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 12:00:07,317 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 12:00:07,329 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,330 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,339 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/1) ... [2018-12-04 12:00:07,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 12:00:07,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 12:00:07,342 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 12:00:07,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 12:00:07,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (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 [2018-12-04 12:00:07,421 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-04 12:00:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 12:00:07,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 12:00:07,754 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 12:00:07,754 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-04 12:00:07,755 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 12:00:07 BoogieIcfgContainer [2018-12-04 12:00:07,755 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 12:00:07,756 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 12:00:07,756 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 12:00:07,759 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 12:00:07,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 12:00:07" (1/2) ... [2018-12-04 12:00:07,760 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12afcdbf and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 12:00:07, skipping insertion in model container [2018-12-04 12:00:07,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 12:00:07" (2/2) ... [2018-12-04 12:00:07,762 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2018-12-04 12:00:07,772 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 12:00:07,780 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 12:00:07,798 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 12:00:07,829 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 12:00:07,829 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 12:00:07,830 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 12:00:07,830 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 12:00:07,830 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 12:00:07,830 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 12:00:07,830 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 12:00:07,831 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 12:00:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-04 12:00:07,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 12:00:07,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:07,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 12:00:07,857 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:07,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2018-12-04 12:00:07,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:07,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:07,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:07,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:08,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:08,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 12:00:08,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 12:00:08,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 12:00:08,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 12:00:08,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 12:00:08,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 12:00:08,135 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2018-12-04 12:00:08,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:08,328 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-04 12:00:08,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 12:00:08,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-04 12:00:08,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:08,341 INFO L225 Difference]: With dead ends: 26 [2018-12-04 12:00:08,341 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 12:00:08,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-04 12:00:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 12:00:08,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-04 12:00:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 12:00:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-04 12:00:08,381 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2018-12-04 12:00:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:08,382 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-04 12:00:08,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 12:00:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2018-12-04 12:00:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 12:00:08,383 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:08,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 12:00:08,383 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:08,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2018-12-04 12:00:08,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:08,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:08,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:08,742 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-12-04 12:00:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:08,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 12:00:08,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-04 12:00:08,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 12:00:08,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 12:00:08,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 12:00:08,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-04 12:00:08,748 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2018-12-04 12:00:08,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:08,845 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-04 12:00:08,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-04 12:00:08,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-04 12:00:08,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:08,847 INFO L225 Difference]: With dead ends: 25 [2018-12-04 12:00:08,847 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 12:00:08,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-04 12:00:08,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 12:00:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-04 12:00:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 12:00:08,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-12-04 12:00:08,856 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2018-12-04 12:00:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:08,857 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-04 12:00:08,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 12:00:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-12-04 12:00:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 12:00:08,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:08,858 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 12:00:08,859 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:08,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:08,860 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2018-12-04 12:00:08,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:08,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:08,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:08,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:08,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:08,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:08,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-04 12:00:08,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 12:00:08,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 12:00:08,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 12:00:08,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 12:00:08,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 12:00:08,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 12:00:08,932 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2018-12-04 12:00:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:08,989 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-04 12:00:08,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 12:00:08,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-04 12:00:08,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:08,991 INFO L225 Difference]: With dead ends: 24 [2018-12-04 12:00:08,991 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 12:00:08,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 12:00:08,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 12:00:08,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-04 12:00:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 12:00:08,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-04 12:00:08,995 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-04 12:00:08,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:08,995 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-04 12:00:08,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 12:00:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-04 12:00:08,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-04 12:00:08,996 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:08,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 12:00:08,997 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:08,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:08,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2018-12-04 12:00:08,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:08,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:08,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:08,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:09,305 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-04 12:00:09,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:09,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:09,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:09,358 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-04 12:00:09,363 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2018-12-04 12:00:09,424 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 12:00:09,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 12:00:09,669 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 12:00:09,670 INFO L272 AbstractInterpreter]: Visited 9 different actions 46 times. Merged at 8 different actions 36 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-04 12:00:09,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:09,688 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 12:00:09,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:09,689 INFO L192 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 [2018-12-04 12:00:09,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:09,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:09,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:09,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:09,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:09,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:09,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2018-12-04 12:00:09,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:09,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 12:00:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 12:00:09,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-04 12:00:09,947 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-04 12:00:10,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:10,205 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-04 12:00:10,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 12:00:10,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-04 12:00:10,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:10,208 INFO L225 Difference]: With dead ends: 26 [2018-12-04 12:00:10,209 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 12:00:10,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-04 12:00:10,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 12:00:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-04 12:00:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-04 12:00:10,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-04 12:00:10,218 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2018-12-04 12:00:10,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:10,218 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-04 12:00:10,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 12:00:10,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-04 12:00:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-04 12:00:10,220 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:10,220 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 12:00:10,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:10,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:10,221 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2018-12-04 12:00:10,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:10,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:10,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:10,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:10,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:10,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:10,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:10,329 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-04 12:00:10,329 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2018-12-04 12:00:10,332 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-04 12:00:10,332 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 12:00:10,544 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 12:00:10,544 INFO L272 AbstractInterpreter]: Visited 12 different actions 96 times. Merged at 11 different actions 70 times. Widened at 3 different actions 7 times. Found 16 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-04 12:00:10,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:10,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 12:00:10,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:10,572 INFO L192 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 [2018-12-04 12:00:10,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:10,587 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:10,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:10,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:10,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:10,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:10,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2018-12-04 12:00:10,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:10,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-04 12:00:10,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-04 12:00:10,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-04 12:00:10,773 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-12-04 12:00:11,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:11,207 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-04 12:00:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-04 12:00:11,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-12-04 12:00:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:11,208 INFO L225 Difference]: With dead ends: 31 [2018-12-04 12:00:11,209 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 12:00:11,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-04 12:00:11,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 12:00:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-04 12:00:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 12:00:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-04 12:00:11,214 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-12-04 12:00:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:11,214 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-04 12:00:11,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-04 12:00:11,214 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-04 12:00:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 12:00:11,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:11,215 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-04 12:00:11,215 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:11,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2018-12-04 12:00:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:11,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:11,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:11,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:11,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:11,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:11,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:11,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:11,563 INFO L192 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 [2018-12-04 12:00:11,583 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:11,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:11,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-04 12:00:11,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:11,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:11,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:11,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-12-04 12:00:11,759 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:11,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 12:00:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 12:00:11,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-04 12:00:11,761 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-12-04 12:00:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:12,055 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-04 12:00:12,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 12:00:12,056 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-04 12:00:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:12,058 INFO L225 Difference]: With dead ends: 35 [2018-12-04 12:00:12,058 INFO L226 Difference]: Without dead ends: 28 [2018-12-04 12:00:12,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-04 12:00:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-04 12:00:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-12-04 12:00:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 12:00:12,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-04 12:00:12,064 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-12-04 12:00:12,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:12,065 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-04 12:00:12,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 12:00:12,065 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-04 12:00:12,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 12:00:12,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:12,066 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-04 12:00:12,066 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:12,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:12,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2018-12-04 12:00:12,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:12,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:12,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:12,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:12,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:12,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:12,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:12,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:12,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:12,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:12,294 INFO L192 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 [2018-12-04 12:00:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:12,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:12,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:12,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:12,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:12,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:12,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:12,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-04 12:00:12,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:12,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 12:00:12,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 12:00:12,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-04 12:00:12,398 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2018-12-04 12:00:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:12,517 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-04 12:00:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-04 12:00:12,518 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-04 12:00:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:12,520 INFO L225 Difference]: With dead ends: 45 [2018-12-04 12:00:12,520 INFO L226 Difference]: Without dead ends: 26 [2018-12-04 12:00:12,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-04 12:00:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-04 12:00:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-04 12:00:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-04 12:00:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-04 12:00:12,526 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2018-12-04 12:00:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:12,526 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-04 12:00:12,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 12:00:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-04 12:00:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-04 12:00:12,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:12,527 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-04 12:00:12,527 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:12,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:12,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2018-12-04 12:00:12,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:12,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:12,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:12,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:12,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:12,735 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:12,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:12,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:12,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:12,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:12,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:12,737 INFO L192 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 [2018-12-04 12:00:12,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:12,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:12,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:12,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:12,951 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:12,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:12,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2018-12-04 12:00:12,970 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:12,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 12:00:12,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 12:00:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-04 12:00:12,971 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2018-12-04 12:00:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:13,344 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-04 12:00:13,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 12:00:13,347 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-12-04 12:00:13,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:13,349 INFO L225 Difference]: With dead ends: 49 [2018-12-04 12:00:13,349 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 12:00:13,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-04 12:00:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 12:00:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-12-04 12:00:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-04 12:00:13,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-04 12:00:13,356 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-12-04 12:00:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:13,357 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-04 12:00:13,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 12:00:13,357 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-04 12:00:13,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-04 12:00:13,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:13,358 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-04 12:00:13,358 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:13,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:13,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2018-12-04 12:00:13,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:13,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:13,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:13,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:13,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:13,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:13,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:13,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:13,597 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:13,597 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:13,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:13,598 INFO L192 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 [2018-12-04 12:00:13,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:13,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:13,617 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 12:00:13,617 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:13,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:13,689 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:13,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:13,737 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:13,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-04 12:00:13,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:13,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-04 12:00:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-04 12:00:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-04 12:00:13,765 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-12-04 12:00:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:14,120 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-12-04 12:00:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-04 12:00:14,121 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-04 12:00:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:14,122 INFO L225 Difference]: With dead ends: 60 [2018-12-04 12:00:14,122 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 12:00:14,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-04 12:00:14,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 12:00:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-04 12:00:14,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 12:00:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-04 12:00:14,129 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-12-04 12:00:14,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:14,129 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-04 12:00:14,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-04 12:00:14,129 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-04 12:00:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 12:00:14,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:14,130 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-04 12:00:14,130 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:14,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2018-12-04 12:00:14,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:14,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:14,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:14,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:14,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:14,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:14,358 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:14,358 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:14,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:14,358 INFO L192 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 [2018-12-04 12:00:14,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:14,368 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:14,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:14,377 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:14,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:14,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:14,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:14,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2018-12-04 12:00:14,579 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:14,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 12:00:14,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 12:00:14,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-04 12:00:14,582 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2018-12-04 12:00:15,427 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-04 12:00:15,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:15,731 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-04 12:00:15,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 12:00:15,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-04 12:00:15,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:15,733 INFO L225 Difference]: With dead ends: 64 [2018-12-04 12:00:15,733 INFO L226 Difference]: Without dead ends: 50 [2018-12-04 12:00:15,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-12-04 12:00:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-04 12:00:15,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-12-04 12:00:15,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 12:00:15,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-04 12:00:15,744 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2018-12-04 12:00:15,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:15,746 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-04 12:00:15,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 12:00:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-04 12:00:15,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 12:00:15,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:15,747 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-04 12:00:15,747 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:15,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:15,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2018-12-04 12:00:15,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:15,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:15,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:15,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:16,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:16,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:16,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:16,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:16,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:16,290 INFO L192 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 [2018-12-04 12:00:16,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:16,301 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:16,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:16,498 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:16,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:16,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:16,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-12-04 12:00:16,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:16,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 12:00:16,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 12:00:16,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-04 12:00:16,676 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2018-12-04 12:00:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:17,044 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-04 12:00:17,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-04 12:00:17,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-12-04 12:00:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:17,045 INFO L225 Difference]: With dead ends: 75 [2018-12-04 12:00:17,045 INFO L226 Difference]: Without dead ends: 40 [2018-12-04 12:00:17,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-04 12:00:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-04 12:00:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-12-04 12:00:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-04 12:00:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-04 12:00:17,053 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2018-12-04 12:00:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:17,054 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-04 12:00:17,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 12:00:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-04 12:00:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-04 12:00:17,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:17,055 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-04 12:00:17,055 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:17,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2018-12-04 12:00:17,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:17,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:17,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:17,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:17,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:17,338 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:17,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:17,338 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:17,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:17,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:17,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:17,339 INFO L192 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 [2018-12-04 12:00:17,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:17,349 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:17,360 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-04 12:00:17,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:17,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:17,824 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:17,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:18,677 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:18,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:18,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2018-12-04 12:00:18,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:18,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 12:00:18,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 12:00:18,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 12:00:18,699 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2018-12-04 12:00:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:20,768 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-12-04 12:00:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 12:00:20,769 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-12-04 12:00:20,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:20,770 INFO L225 Difference]: With dead ends: 97 [2018-12-04 12:00:20,770 INFO L226 Difference]: Without dead ends: 58 [2018-12-04 12:00:20,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 12:00:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-04 12:00:20,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-12-04 12:00:20,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 12:00:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-04 12:00:20,781 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2018-12-04 12:00:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:20,781 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-04 12:00:20,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 12:00:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-04 12:00:20,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 12:00:20,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:20,783 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2018-12-04 12:00:20,783 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:20,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:20,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2018-12-04 12:00:20,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:20,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:20,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:20,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:21,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:21,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:21,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:21,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:21,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:21,321 INFO L192 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 [2018-12-04 12:00:21,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:21,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:21,341 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:21,341 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:21,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:21,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:21,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:21,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2018-12-04 12:00:21,711 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:21,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 12:00:21,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 12:00:21,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-12-04 12:00:21,712 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2018-12-04 12:00:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:23,087 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-12-04 12:00:23,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 12:00:23,087 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-04 12:00:23,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:23,089 INFO L225 Difference]: With dead ends: 94 [2018-12-04 12:00:23,089 INFO L226 Difference]: Without dead ends: 72 [2018-12-04 12:00:23,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2018-12-04 12:00:23,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-04 12:00:23,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2018-12-04 12:00:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 12:00:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-04 12:00:23,099 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2018-12-04 12:00:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-04 12:00:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 12:00:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-04 12:00:23,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 12:00:23,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:23,101 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-04 12:00:23,101 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:23,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:23,102 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2018-12-04 12:00:23,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:23,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:23,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:23,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:23,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:23,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:23,314 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:23,314 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:23,315 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:23,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:23,315 INFO L192 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 [2018-12-04 12:00:23,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:23,326 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:23,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:23,480 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:23,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:23,576 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:23,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:23,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-12-04 12:00:23,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:23,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 12:00:23,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 12:00:23,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-04 12:00:23,598 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2018-12-04 12:00:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:23,889 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-04 12:00:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-04 12:00:23,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-12-04 12:00:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:23,892 INFO L225 Difference]: With dead ends: 105 [2018-12-04 12:00:23,892 INFO L226 Difference]: Without dead ends: 54 [2018-12-04 12:00:23,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2018-12-04 12:00:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-04 12:00:23,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-04 12:00:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-04 12:00:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-04 12:00:23,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2018-12-04 12:00:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:23,902 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-04 12:00:23,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 12:00:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-04 12:00:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-04 12:00:23,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:23,903 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-04 12:00:23,904 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:23,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2018-12-04 12:00:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:23,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:23,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:23,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:24,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:24,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:24,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:24,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:24,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:24,283 INFO L192 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 [2018-12-04 12:00:24,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:24,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:24,308 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 12:00:24,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:24,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:24,573 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:24,574 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:24,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:24,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2018-12-04 12:00:24,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:24,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 12:00:24,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 12:00:24,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-12-04 12:00:24,658 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-12-04 12:00:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:26,122 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-04 12:00:26,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 12:00:26,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-12-04 12:00:26,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:26,124 INFO L225 Difference]: With dead ends: 109 [2018-12-04 12:00:26,124 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 12:00:26,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 12:00:26,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 12:00:26,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-12-04 12:00:26,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-04 12:00:26,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-04 12:00:26,135 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2018-12-04 12:00:26,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:26,135 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-04 12:00:26,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 12:00:26,135 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-04 12:00:26,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-04 12:00:26,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:26,137 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-04 12:00:26,137 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:26,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:26,137 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2018-12-04 12:00:26,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:26,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:26,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:26,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:26,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:26,453 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:26,453 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:26,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:26,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:26,454 INFO L192 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 [2018-12-04 12:00:26,463 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:26,463 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:26,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:26,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:26,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:26,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:26,783 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:26,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:26,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-12-04 12:00:26,803 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:26,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-04 12:00:26,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-04 12:00:26,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-12-04 12:00:26,804 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2018-12-04 12:00:27,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:27,149 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-12-04 12:00:27,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-04 12:00:27,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-12-04 12:00:27,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:27,151 INFO L225 Difference]: With dead ends: 120 [2018-12-04 12:00:27,151 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 12:00:27,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 12:00:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 12:00:27,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-04 12:00:27,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 12:00:27,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-04 12:00:27,162 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2018-12-04 12:00:27,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:27,163 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-04 12:00:27,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-04 12:00:27,163 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-04 12:00:27,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 12:00:27,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:27,164 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-04 12:00:27,164 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:27,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:27,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2018-12-04 12:00:27,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:27,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:27,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:27,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:27,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:27,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:27,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:27,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:27,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:27,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:27,646 INFO L192 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 [2018-12-04 12:00:27,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:27,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:27,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:27,940 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:27,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:28,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:28,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2018-12-04 12:00:28,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:28,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 12:00:28,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 12:00:28,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-12-04 12:00:28,077 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2018-12-04 12:00:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:29,644 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-12-04 12:00:29,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 12:00:29,652 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-12-04 12:00:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:29,653 INFO L225 Difference]: With dead ends: 124 [2018-12-04 12:00:29,653 INFO L226 Difference]: Without dead ends: 94 [2018-12-04 12:00:29,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-12-04 12:00:29,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-04 12:00:29,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2018-12-04 12:00:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 12:00:29,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-04 12:00:29,672 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2018-12-04 12:00:29,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:29,673 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-04 12:00:29,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 12:00:29,673 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-04 12:00:29,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 12:00:29,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:29,674 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-04 12:00:29,674 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:29,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:29,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2018-12-04 12:00:29,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:29,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:29,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:29,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:29,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:29,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:29,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:29,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:29,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:29,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:29,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:29,922 INFO L192 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 [2018-12-04 12:00:29,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:29,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:29,947 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-04 12:00:29,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:29,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:30,196 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:30,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:30,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:30,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-12-04 12:00:30,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:30,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 12:00:30,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 12:00:30,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-12-04 12:00:30,364 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2018-12-04 12:00:31,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:31,036 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-04 12:00:31,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 12:00:31,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-12-04 12:00:31,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:31,037 INFO L225 Difference]: With dead ends: 135 [2018-12-04 12:00:31,037 INFO L226 Difference]: Without dead ends: 68 [2018-12-04 12:00:31,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 12:00:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-04 12:00:31,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-04 12:00:31,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-04 12:00:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-04 12:00:31,049 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2018-12-04 12:00:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:31,050 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-04 12:00:31,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 12:00:31,050 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-04 12:00:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-04 12:00:31,051 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:31,051 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-04 12:00:31,051 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:31,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:31,052 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2018-12-04 12:00:31,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:31,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:31,053 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:31,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:31,868 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:31,868 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:31,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:31,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:31,868 INFO L192 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 [2018-12-04 12:00:31,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:31,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:31,898 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:31,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:31,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:32,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:32,331 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:32,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:32,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2018-12-04 12:00:32,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:32,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 12:00:32,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 12:00:32,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2018-12-04 12:00:32,353 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2018-12-04 12:00:34,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:34,183 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-04 12:00:34,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 12:00:34,183 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2018-12-04 12:00:34,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:34,184 INFO L225 Difference]: With dead ends: 139 [2018-12-04 12:00:34,185 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 12:00:34,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 12:00:34,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 12:00:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2018-12-04 12:00:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-04 12:00:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-04 12:00:34,195 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2018-12-04 12:00:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:34,196 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-04 12:00:34,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 12:00:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-04 12:00:34,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-04 12:00:34,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:34,197 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-04 12:00:34,197 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:34,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:34,198 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2018-12-04 12:00:34,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:34,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:34,198 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:34,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:34,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:34,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:34,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:34,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:34,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:34,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:34,580 INFO L192 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 [2018-12-04 12:00:34,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:34,589 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:34,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:35,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:35,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:35,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-12-04 12:00:35,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:35,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-04 12:00:35,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-04 12:00:35,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-12-04 12:00:35,494 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2018-12-04 12:00:35,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:35,880 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-12-04 12:00:35,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-04 12:00:35,880 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-12-04 12:00:35,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:35,881 INFO L225 Difference]: With dead ends: 150 [2018-12-04 12:00:35,881 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 12:00:35,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2018-12-04 12:00:35,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 12:00:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-04 12:00:35,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 12:00:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-04 12:00:35,894 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2018-12-04 12:00:35,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:35,894 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-04 12:00:35,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-04 12:00:35,894 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-04 12:00:35,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 12:00:35,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:35,895 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-04 12:00:35,895 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:35,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:35,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2018-12-04 12:00:35,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:35,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:35,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:35,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:35,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:36,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:36,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:36,409 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:36,409 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:36,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:36,409 INFO L192 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 [2018-12-04 12:00:36,418 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:36,418 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:36,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 12:00:36,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:36,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:37,582 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:37,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:38,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2018-12-04 12:00:38,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:38,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 12:00:38,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 12:00:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 12:00:38,376 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2018-12-04 12:00:40,947 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-04 12:00:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:43,085 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-12-04 12:00:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 12:00:43,086 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2018-12-04 12:00:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:43,087 INFO L225 Difference]: With dead ends: 192 [2018-12-04 12:00:43,087 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 12:00:43,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2018-12-04 12:00:43,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 12:00:43,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2018-12-04 12:00:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-04 12:00:43,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-04 12:00:43,102 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2018-12-04 12:00:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:43,102 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-04 12:00:43,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 12:00:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-04 12:00:43,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-04 12:00:43,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:43,103 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2018-12-04 12:00:43,103 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:43,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2018-12-04 12:00:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:43,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:43,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:44,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:44,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:44,304 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:44,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:44,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:44,305 INFO L192 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 [2018-12-04 12:00:44,320 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:44,320 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:44,336 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:44,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:44,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:45,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:45,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:45,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2018-12-04 12:00:45,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:45,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 12:00:45,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 12:00:45,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 12:00:45,100 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2018-12-04 12:00:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:47,491 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-12-04 12:00:47,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 12:00:47,494 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2018-12-04 12:00:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:47,494 INFO L225 Difference]: With dead ends: 169 [2018-12-04 12:00:47,495 INFO L226 Difference]: Without dead ends: 127 [2018-12-04 12:00:47,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2018-12-04 12:00:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-04 12:00:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-12-04 12:00:47,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-04 12:00:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-04 12:00:47,505 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2018-12-04 12:00:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:47,506 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-04 12:00:47,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 12:00:47,506 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-04 12:00:47,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-04 12:00:47,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:47,507 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-04 12:00:47,507 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:47,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:47,507 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2018-12-04 12:00:47,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:47,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:47,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:47,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:47,813 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:47,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:47,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:47,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:47,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:47,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:47,813 INFO L192 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 [2018-12-04 12:00:47,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:47,823 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:00:47,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:47,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:48,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:48,332 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:48,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:48,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-12-04 12:00:48,351 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:48,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-04 12:00:48,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-04 12:00:48,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 12:00:48,352 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2018-12-04 12:00:48,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:48,879 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2018-12-04 12:00:48,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 12:00:48,879 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-12-04 12:00:48,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:48,880 INFO L225 Difference]: With dead ends: 180 [2018-12-04 12:00:48,881 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 12:00:48,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 12:00:48,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 12:00:48,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-12-04 12:00:48,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 12:00:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-04 12:00:48,896 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2018-12-04 12:00:48,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:48,896 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-04 12:00:48,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-04 12:00:48,896 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-04 12:00:48,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 12:00:48,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:48,897 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-04 12:00:48,897 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:48,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:48,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2018-12-04 12:00:48,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:48,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:48,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:00:48,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:48,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:49,497 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:49,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:49,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:49,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:49,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:49,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:49,498 INFO L192 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 [2018-12-04 12:00:49,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:00:49,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:00:49,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 12:00:49,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:49,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:00:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:50,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:00:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:51,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:00:51,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2018-12-04 12:00:51,700 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:00:51,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 12:00:51,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 12:00:51,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2018-12-04 12:00:51,702 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2018-12-04 12:00:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:00:58,588 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2018-12-04 12:00:58,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 12:00:58,589 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2018-12-04 12:00:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:00:58,590 INFO L225 Difference]: With dead ends: 230 [2018-12-04 12:00:58,591 INFO L226 Difference]: Without dead ends: 135 [2018-12-04 12:00:58,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2018-12-04 12:00:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-04 12:00:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2018-12-04 12:00:58,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-04 12:00:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-04 12:00:58,609 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2018-12-04 12:00:58,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:00:58,609 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-04 12:00:58,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 12:00:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-04 12:00:58,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-04 12:00:58,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:00:58,610 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2018-12-04 12:00:58,610 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:00:58,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:00:58,611 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2018-12-04 12:00:58,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:00:58,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:58,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:00:58,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:00:58,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:00:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:00:59,485 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:00:59,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:59,486 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:00:59,486 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:00:59,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:00:59,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:00:59,486 INFO L192 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 [2018-12-04 12:00:59,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:00:59,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:00:59,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:00:59,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:00:59,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:00,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:00,106 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:00,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:00,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2018-12-04 12:01:00,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:00,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 12:01:00,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 12:01:00,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 12:01:00,126 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2018-12-04 12:01:03,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:03,466 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2018-12-04 12:01:03,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 12:01:03,467 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2018-12-04 12:01:03,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:03,468 INFO L225 Difference]: With dead ends: 199 [2018-12-04 12:01:03,468 INFO L226 Difference]: Without dead ends: 149 [2018-12-04 12:01:03,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 12:01:03,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-04 12:01:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2018-12-04 12:01:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-04 12:01:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-04 12:01:03,484 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2018-12-04 12:01:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:03,484 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-04 12:01:03,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 12:01:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-04 12:01:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-04 12:01:03,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:03,485 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-04 12:01:03,485 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:03,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2018-12-04 12:01:03,486 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:03,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:03,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:03,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:03,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:03,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:03,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:03,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:03,864 INFO L192 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 [2018-12-04 12:01:03,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:03,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:03,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:03,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:04,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:05,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:05,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2018-12-04 12:01:05,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:05,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-04 12:01:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-04 12:01:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-12-04 12:01:05,147 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2018-12-04 12:01:05,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:05,836 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-12-04 12:01:05,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-04 12:01:05,836 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2018-12-04 12:01:05,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:05,838 INFO L225 Difference]: With dead ends: 210 [2018-12-04 12:01:05,838 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 12:01:05,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 12:01:05,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 12:01:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-04 12:01:05,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 12:01:05,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-04 12:01:05,855 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2018-12-04 12:01:05,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:05,855 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-04 12:01:05,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-04 12:01:05,856 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-04 12:01:05,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 12:01:05,856 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:05,856 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-04 12:01:05,856 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:05,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:05,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2018-12-04 12:01:05,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:05,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:05,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:05,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:06,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:06,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:06,506 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:06,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:06,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:06,506 INFO L192 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 [2018-12-04 12:01:06,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:06,515 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:06,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-04 12:01:06,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:06,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:07,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:07,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:07,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2018-12-04 12:01:07,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:07,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 12:01:07,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 12:01:07,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2018-12-04 12:01:07,615 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2018-12-04 12:01:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:11,089 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2018-12-04 12:01:11,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 12:01:11,090 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2018-12-04 12:01:11,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:11,091 INFO L225 Difference]: With dead ends: 214 [2018-12-04 12:01:11,091 INFO L226 Difference]: Without dead ends: 160 [2018-12-04 12:01:11,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2018-12-04 12:01:11,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-04 12:01:11,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2018-12-04 12:01:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 12:01:11,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-04 12:01:11,109 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2018-12-04 12:01:11,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:11,109 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-04 12:01:11,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 12:01:11,109 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-04 12:01:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 12:01:11,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:11,110 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-04 12:01:11,110 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:11,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:11,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2018-12-04 12:01:11,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:11,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:11,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:11,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:11,500 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:11,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:11,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:11,501 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:11,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:11,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:11,501 INFO L192 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 [2018-12-04 12:01:11,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:11,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:11,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:11,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:11,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:11,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:12,248 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:12,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2018-12-04 12:01:12,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:12,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 12:01:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 12:01:12,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-12-04 12:01:12,269 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2018-12-04 12:01:13,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:13,056 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-04 12:01:13,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 12:01:13,056 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2018-12-04 12:01:13,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:13,058 INFO L225 Difference]: With dead ends: 225 [2018-12-04 12:01:13,058 INFO L226 Difference]: Without dead ends: 110 [2018-12-04 12:01:13,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 12:01:13,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-04 12:01:13,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-12-04 12:01:13,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-04 12:01:13,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-04 12:01:13,079 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2018-12-04 12:01:13,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:13,079 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-04 12:01:13,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 12:01:13,079 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-04 12:01:13,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-04 12:01:13,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:13,080 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-04 12:01:13,080 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:13,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:13,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2018-12-04 12:01:13,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:13,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:13,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:13,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:13,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:13,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:13,956 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:13,956 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:13,956 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:13,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:13,957 INFO L192 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 [2018-12-04 12:01:13,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:13,965 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:13,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:14,643 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:14,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:14,723 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:14,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:14,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2018-12-04 12:01:14,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:14,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 12:01:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 12:01:14,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 12:01:14,745 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2018-12-04 12:01:17,849 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-04 12:01:19,464 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-04 12:01:19,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:19,804 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2018-12-04 12:01:19,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 12:01:19,804 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2018-12-04 12:01:19,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:19,805 INFO L225 Difference]: With dead ends: 229 [2018-12-04 12:01:19,805 INFO L226 Difference]: Without dead ends: 171 [2018-12-04 12:01:19,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 12:01:19,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-04 12:01:19,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2018-12-04 12:01:19,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-04 12:01:19,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-04 12:01:19,828 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2018-12-04 12:01:19,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:19,828 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-04 12:01:19,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 12:01:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-04 12:01:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-04 12:01:19,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:19,829 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-04 12:01:19,829 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:19,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:19,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2018-12-04 12:01:19,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:19,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:19,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:19,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:19,831 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:20,240 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:20,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:20,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:20,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:20,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:20,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:20,241 INFO L192 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 [2018-12-04 12:01:20,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:20,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:20,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 12:01:20,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:20,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:20,726 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:20,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:21,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:21,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2018-12-04 12:01:21,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:21,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-04 12:01:21,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-04 12:01:21,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-12-04 12:01:21,060 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2018-12-04 12:01:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:21,585 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2018-12-04 12:01:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-04 12:01:21,586 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2018-12-04 12:01:21,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:21,587 INFO L225 Difference]: With dead ends: 240 [2018-12-04 12:01:21,587 INFO L226 Difference]: Without dead ends: 117 [2018-12-04 12:01:21,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-12-04 12:01:21,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-04 12:01:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-04 12:01:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-04 12:01:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-04 12:01:21,605 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2018-12-04 12:01:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:21,605 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-04 12:01:21,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-04 12:01:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-04 12:01:21,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-04 12:01:21,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:21,606 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-04 12:01:21,606 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:21,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:21,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2018-12-04 12:01:21,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:21,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:21,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:21,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:21,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:22,885 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:22,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:22,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:22,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:22,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:22,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:22,886 INFO L192 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 [2018-12-04 12:01:22,897 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:22,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:22,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:22,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:22,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:23,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:23,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:23,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2018-12-04 12:01:23,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:23,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 12:01:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 12:01:23,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2018-12-04 12:01:23,778 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2018-12-04 12:01:27,913 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2018-12-04 12:01:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:28,990 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2018-12-04 12:01:28,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 12:01:28,990 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2018-12-04 12:01:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:28,992 INFO L225 Difference]: With dead ends: 244 [2018-12-04 12:01:28,992 INFO L226 Difference]: Without dead ends: 182 [2018-12-04 12:01:28,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2018-12-04 12:01:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-04 12:01:29,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2018-12-04 12:01:29,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-04 12:01:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-04 12:01:29,014 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2018-12-04 12:01:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:29,015 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-04 12:01:29,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 12:01:29,015 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-04 12:01:29,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-04 12:01:29,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:29,016 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-04 12:01:29,016 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:29,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:29,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2018-12-04 12:01:29,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:29,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:29,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:29,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:29,823 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:29,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:29,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:29,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:29,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:29,823 INFO L192 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 [2018-12-04 12:01:29,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:29,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:29,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:30,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:30,752 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:30,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:30,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2018-12-04 12:01:30,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:30,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 12:01:30,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 12:01:30,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-12-04 12:01:30,773 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2018-12-04 12:01:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:31,663 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2018-12-04 12:01:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-04 12:01:31,663 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2018-12-04 12:01:31,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:31,664 INFO L225 Difference]: With dead ends: 255 [2018-12-04 12:01:31,665 INFO L226 Difference]: Without dead ends: 124 [2018-12-04 12:01:31,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 12:01:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-04 12:01:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-04 12:01:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-04 12:01:31,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-04 12:01:31,684 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2018-12-04 12:01:31,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:31,684 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-04 12:01:31,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 12:01:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-04 12:01:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-04 12:01:31,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:31,685 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-04 12:01:31,685 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:31,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:31,686 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2018-12-04 12:01:31,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:31,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:31,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:32,644 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:32,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:32,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:32,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:32,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:32,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:32,645 INFO L192 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 [2018-12-04 12:01:32,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:32,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:32,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-04 12:01:32,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:32,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:34,942 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:34,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:36,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:36,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2018-12-04 12:01:36,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:36,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-04 12:01:36,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-04 12:01:36,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 12:01:36,756 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2018-12-04 12:01:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:47,072 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2018-12-04 12:01:47,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-04 12:01:47,072 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2018-12-04 12:01:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:47,073 INFO L225 Difference]: With dead ends: 325 [2018-12-04 12:01:47,073 INFO L226 Difference]: Without dead ends: 190 [2018-12-04 12:01:47,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2018-12-04 12:01:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-04 12:01:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2018-12-04 12:01:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-04 12:01:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-04 12:01:47,096 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2018-12-04 12:01:47,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:47,096 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-04 12:01:47,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-04 12:01:47,097 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-04 12:01:47,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-04 12:01:47,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:47,097 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2018-12-04 12:01:47,098 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:47,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:47,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2018-12-04 12:01:47,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:47,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:47,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:47,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:48,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:48,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:48,156 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:48,156 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:48,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:48,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:48,156 INFO L192 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 [2018-12-04 12:01:48,165 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:01:48,165 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:01:48,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:01:48,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:48,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:49,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:49,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:49,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:49,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:49,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2018-12-04 12:01:49,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:49,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 12:01:49,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 12:01:49,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 12:01:49,420 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2018-12-04 12:01:53,538 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-12-04 12:01:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:54,931 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2018-12-04 12:01:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 12:01:54,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2018-12-04 12:01:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:54,934 INFO L225 Difference]: With dead ends: 274 [2018-12-04 12:01:54,934 INFO L226 Difference]: Without dead ends: 204 [2018-12-04 12:01:54,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 12:01:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-04 12:01:54,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-12-04 12:01:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-04 12:01:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-04 12:01:54,958 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2018-12-04 12:01:54,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:54,959 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-04 12:01:54,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 12:01:54,959 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-04 12:01:54,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-04 12:01:54,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:54,960 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-04 12:01:54,960 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:54,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:54,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2018-12-04 12:01:54,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:54,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:01:54,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:54,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:55,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:55,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:55,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:55,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:55,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:55,738 INFO L192 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 [2018-12-04 12:01:55,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:55,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:01:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:55,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:01:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:56,433 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:01:56,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:56,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:01:56,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2018-12-04 12:01:56,883 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:01:56,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 12:01:56,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 12:01:56,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 12:01:56,884 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2018-12-04 12:01:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:01:57,749 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2018-12-04 12:01:57,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-04 12:01:57,750 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2018-12-04 12:01:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:01:57,751 INFO L225 Difference]: With dead ends: 285 [2018-12-04 12:01:57,751 INFO L226 Difference]: Without dead ends: 138 [2018-12-04 12:01:57,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 12:01:57,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-04 12:01:57,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-04 12:01:57,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-04 12:01:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-04 12:01:57,777 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2018-12-04 12:01:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:01:57,777 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-04 12:01:57,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 12:01:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-04 12:01:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-04 12:01:57,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:01:57,778 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-04 12:01:57,778 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:01:57,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:01:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2018-12-04 12:01:57,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:01:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:57,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:01:57,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:01:57,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:01:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:01:59,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:01:59,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:59,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:01:59,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:01:59,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:01:59,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:01:59,121 INFO L192 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 [2018-12-04 12:01:59,130 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:01:59,130 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:01:59,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 12:01:59,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:01:59,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:01,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:01,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:04,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:04,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2018-12-04 12:02:04,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:04,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 12:02:04,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 12:02:04,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2018-12-04 12:02:04,244 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2018-12-04 12:02:14,954 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-04 12:02:15,238 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-04 12:02:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:17,764 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2018-12-04 12:02:17,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-04 12:02:17,765 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2018-12-04 12:02:17,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:17,766 INFO L225 Difference]: With dead ends: 363 [2018-12-04 12:02:17,766 INFO L226 Difference]: Without dead ends: 212 [2018-12-04 12:02:17,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2018-12-04 12:02:17,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-04 12:02:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2018-12-04 12:02:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-04 12:02:17,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-04 12:02:17,796 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2018-12-04 12:02:17,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:17,797 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-04 12:02:17,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 12:02:17,797 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-04 12:02:17,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-04 12:02:17,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:17,797 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2018-12-04 12:02:17,798 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:17,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:17,798 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2018-12-04 12:02:17,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:17,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:17,798 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:17,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:17,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:19,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:19,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:19,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:19,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:19,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:19,346 INFO L192 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 [2018-12-04 12:02:19,356 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:02:19,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:02:19,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:02:19,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:19,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:20,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:20,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:20,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:20,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:20,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2018-12-04 12:02:20,965 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:20,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 12:02:20,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 12:02:20,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2018-12-04 12:02:20,966 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2018-12-04 12:02:25,316 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-04 12:02:25,594 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-04 12:02:25,855 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-04 12:02:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:27,682 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2018-12-04 12:02:27,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 12:02:27,683 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2018-12-04 12:02:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:27,684 INFO L225 Difference]: With dead ends: 304 [2018-12-04 12:02:27,685 INFO L226 Difference]: Without dead ends: 226 [2018-12-04 12:02:27,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2018-12-04 12:02:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-04 12:02:27,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2018-12-04 12:02:27,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-04 12:02:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-04 12:02:27,711 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2018-12-04 12:02:27,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:27,711 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-04 12:02:27,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 12:02:27,711 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-04 12:02:27,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-04 12:02:27,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:27,712 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-04 12:02:27,712 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:27,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:27,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2018-12-04 12:02:27,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:27,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:27,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:27,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:27,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:28,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:28,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:28,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:28,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:28,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:28,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:28,525 INFO L192 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 [2018-12-04 12:02:28,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:28,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:02:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:28,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:29,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:29,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:30,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:30,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2018-12-04 12:02:30,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:30,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 12:02:30,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 12:02:30,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2018-12-04 12:02:30,210 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2018-12-04 12:02:31,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:31,500 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2018-12-04 12:02:31,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 12:02:31,501 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2018-12-04 12:02:31,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:31,502 INFO L225 Difference]: With dead ends: 315 [2018-12-04 12:02:31,503 INFO L226 Difference]: Without dead ends: 152 [2018-12-04 12:02:31,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 12:02:31,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-04 12:02:31,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-12-04 12:02:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-04 12:02:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-04 12:02:31,537 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2018-12-04 12:02:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:31,537 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-04 12:02:31,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 12:02:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-04 12:02:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-04 12:02:31,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:31,538 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-04 12:02:31,538 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:31,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2018-12-04 12:02:31,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:31,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:31,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:02:31,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:31,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:33,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:33,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:33,753 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:33,753 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:33,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:33,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:33,753 INFO L192 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 [2018-12-04 12:02:33,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:02:33,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:02:33,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 12:02:33,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:33,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:37,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:37,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:39,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:39,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2018-12-04 12:02:39,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:39,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-04 12:02:39,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-04 12:02:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 12:02:39,933 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2018-12-04 12:02:51,617 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-04 12:02:51,921 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-04 12:02:52,223 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-04 12:02:55,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:02:55,280 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2018-12-04 12:02:55,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-12-04 12:02:55,280 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2018-12-04 12:02:55,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:02:55,282 INFO L225 Difference]: With dead ends: 401 [2018-12-04 12:02:55,282 INFO L226 Difference]: Without dead ends: 234 [2018-12-04 12:02:55,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2018-12-04 12:02:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-04 12:02:55,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2018-12-04 12:02:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-04 12:02:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-04 12:02:55,324 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2018-12-04 12:02:55,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:02:55,325 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-04 12:02:55,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-04 12:02:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-04 12:02:55,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-04 12:02:55,326 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:02:55,326 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2018-12-04 12:02:55,326 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:02:55,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:02:55,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2018-12-04 12:02:55,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:02:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:55,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:02:55,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:02:55,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:02:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:02:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:57,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:57,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:02:57,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:02:57,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:02:57,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:02:57,370 INFO L192 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 [2018-12-04 12:02:57,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:02:57,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:02:57,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:02:57,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:02:57,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:02:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:58,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:02:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:02:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:02:58,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2018-12-04 12:02:58,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:02:58,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 12:02:58,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 12:02:58,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2018-12-04 12:02:58,861 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2018-12-04 12:03:04,537 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-04 12:03:04,842 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-04 12:03:05,191 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-04 12:03:05,400 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:03:05,588 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:03:07,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:07,530 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2018-12-04 12:03:07,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 12:03:07,530 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2018-12-04 12:03:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:07,532 INFO L225 Difference]: With dead ends: 334 [2018-12-04 12:03:07,532 INFO L226 Difference]: Without dead ends: 248 [2018-12-04 12:03:07,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2018-12-04 12:03:07,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-04 12:03:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2018-12-04 12:03:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-04 12:03:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-04 12:03:07,577 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2018-12-04 12:03:07,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:07,577 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-04 12:03:07,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 12:03:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-04 12:03:07,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-04 12:03:07,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:07,578 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-04 12:03:07,579 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:07,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:07,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2018-12-04 12:03:07,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:07,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:07,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:07,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:08,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:08,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:08,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:08,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:08,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:08,949 INFO L192 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 [2018-12-04 12:03:08,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:08,958 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:03:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:09,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:10,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:10,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:11,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:11,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:11,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2018-12-04 12:03:11,214 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:11,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 12:03:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 12:03:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2018-12-04 12:03:11,215 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2018-12-04 12:03:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:12,824 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2018-12-04 12:03:12,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-04 12:03:12,825 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2018-12-04 12:03:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:12,826 INFO L225 Difference]: With dead ends: 345 [2018-12-04 12:03:12,826 INFO L226 Difference]: Without dead ends: 166 [2018-12-04 12:03:12,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 12:03:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-04 12:03:12,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-12-04 12:03:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-04 12:03:12,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-04 12:03:12,856 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2018-12-04 12:03:12,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:12,856 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-04 12:03:12,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 12:03:12,856 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-04 12:03:12,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-04 12:03:12,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:12,857 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-04 12:03:12,857 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:12,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:12,858 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2018-12-04 12:03:12,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:12,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:12,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:12,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:12,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:14,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:14,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:14,709 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:14,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:14,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:14,709 INFO L192 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 [2018-12-04 12:03:14,718 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:03:14,718 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:03:14,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-04 12:03:14,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:14,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:16,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:16,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:16,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2018-12-04 12:03:16,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:16,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 12:03:16,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 12:03:16,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 12:03:16,598 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2018-12-04 12:03:23,480 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-04 12:03:23,813 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-04 12:03:24,127 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-04 12:03:24,331 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:03:24,528 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:03:24,716 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:03:25,625 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-04 12:03:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:26,885 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-12-04 12:03:26,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 12:03:26,885 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2018-12-04 12:03:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:26,887 INFO L225 Difference]: With dead ends: 349 [2018-12-04 12:03:26,887 INFO L226 Difference]: Without dead ends: 259 [2018-12-04 12:03:26,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2018-12-04 12:03:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-04 12:03:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2018-12-04 12:03:26,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-04 12:03:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-04 12:03:26,918 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2018-12-04 12:03:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:26,918 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-04 12:03:26,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 12:03:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-04 12:03:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-04 12:03:26,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:26,919 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-04 12:03:26,919 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:26,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:26,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2018-12-04 12:03:26,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:26,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:26,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:26,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:28,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:28,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:28,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:28,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:28,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:28,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:28,698 INFO L192 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 [2018-12-04 12:03:28,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:03:28,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:03:28,733 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:03:28,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:28,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:29,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:29,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:30,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:30,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2018-12-04 12:03:30,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:30,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-04 12:03:30,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-04 12:03:30,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-12-04 12:03:30,467 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2018-12-04 12:03:32,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:32,385 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2018-12-04 12:03:32,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 12:03:32,385 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2018-12-04 12:03:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:32,387 INFO L225 Difference]: With dead ends: 360 [2018-12-04 12:03:32,387 INFO L226 Difference]: Without dead ends: 173 [2018-12-04 12:03:32,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2018-12-04 12:03:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-04 12:03:32,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-12-04 12:03:32,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-04 12:03:32,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-04 12:03:32,421 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2018-12-04 12:03:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:32,421 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-04 12:03:32,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-04 12:03:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-04 12:03:32,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-04 12:03:32,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:32,422 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-04 12:03:32,422 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:32,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:32,423 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2018-12-04 12:03:32,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:32,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:32,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:32,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:32,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:34,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:34,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:34,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:34,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:34,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:34,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:34,829 INFO L192 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 [2018-12-04 12:03:34,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:34,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:03:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:34,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:36,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:37,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:37,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2018-12-04 12:03:37,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:37,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 12:03:37,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 12:03:37,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2018-12-04 12:03:37,174 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2018-12-04 12:03:44,495 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-04 12:03:44,833 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-04 12:03:45,156 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-04 12:03:45,374 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:03:45,582 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:03:45,786 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:03:46,051 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:03:46,295 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-04 12:03:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:48,186 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2018-12-04 12:03:48,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 12:03:48,187 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2018-12-04 12:03:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:48,189 INFO L225 Difference]: With dead ends: 364 [2018-12-04 12:03:48,189 INFO L226 Difference]: Without dead ends: 270 [2018-12-04 12:03:48,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2018-12-04 12:03:48,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-04 12:03:48,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2018-12-04 12:03:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-04 12:03:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-04 12:03:48,229 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2018-12-04 12:03:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:48,230 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-04 12:03:48,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 12:03:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-04 12:03:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-04 12:03:48,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:48,231 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-04 12:03:48,231 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:48,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2018-12-04 12:03:48,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:48,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:48,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:03:48,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:48,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:49,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:49,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:49,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:49,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:49,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:49,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:49,375 INFO L192 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 [2018-12-04 12:03:49,392 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:03:49,392 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:03:49,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 12:03:49,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:49,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:50,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:50,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:51,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:51,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2018-12-04 12:03:51,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:51,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 12:03:51,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 12:03:51,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2018-12-04 12:03:51,845 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2018-12-04 12:03:53,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:03:53,642 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2018-12-04 12:03:53,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-04 12:03:53,642 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2018-12-04 12:03:53,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:03:53,643 INFO L225 Difference]: With dead ends: 375 [2018-12-04 12:03:53,644 INFO L226 Difference]: Without dead ends: 180 [2018-12-04 12:03:53,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 12:03:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-04 12:03:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-12-04 12:03:53,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-04 12:03:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-12-04 12:03:53,680 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2018-12-04 12:03:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:03:53,680 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-12-04 12:03:53,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 12:03:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-12-04 12:03:53,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-04 12:03:53,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:03:53,681 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-04 12:03:53,681 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:03:53,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:03:53,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2018-12-04 12:03:53,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:03:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:53,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:03:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:03:53,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:03:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:03:55,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:55,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:55,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:03:55,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:03:55,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:03:55,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:03:55,335 INFO L192 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 [2018-12-04 12:03:55,343 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:03:55,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:03:55,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:03:55,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:03:55,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:03:57,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:57,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:03:57,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:03:57,468 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:03:57,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2018-12-04 12:03:57,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:03:57,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 12:03:57,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 12:03:57,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 12:03:57,470 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2018-12-04 12:04:03,786 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-04 12:04:04,149 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-04 12:04:04,494 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-04 12:04:04,739 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:04:04,965 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:04:05,188 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:04:05,399 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:04:05,604 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:04:06,584 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2018-12-04 12:04:06,811 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-12-04 12:04:07,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:07,908 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2018-12-04 12:04:07,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 12:04:07,908 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2018-12-04 12:04:07,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:07,909 INFO L225 Difference]: With dead ends: 379 [2018-12-04 12:04:07,910 INFO L226 Difference]: Without dead ends: 281 [2018-12-04 12:04:07,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 12:04:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-04 12:04:07,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2018-12-04 12:04:07,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-04 12:04:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-04 12:04:07,948 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2018-12-04 12:04:07,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:07,948 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-04 12:04:07,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 12:04:07,948 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-04 12:04:07,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-04 12:04:07,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:07,949 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-04 12:04:07,949 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:07,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:07,950 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2018-12-04 12:04:07,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:07,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:07,950 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:07,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:07,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:09,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:09,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:09,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:09,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:09,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:09,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:09,610 INFO L192 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 [2018-12-04 12:04:09,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:09,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:04:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:09,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:10,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:10,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:11,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:11,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:11,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2018-12-04 12:04:11,643 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:11,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-04 12:04:11,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-04 12:04:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-12-04 12:04:11,644 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2018-12-04 12:04:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:13,654 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2018-12-04 12:04:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-04 12:04:13,654 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2018-12-04 12:04:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:13,656 INFO L225 Difference]: With dead ends: 390 [2018-12-04 12:04:13,656 INFO L226 Difference]: Without dead ends: 187 [2018-12-04 12:04:13,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 12:04:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-04 12:04:13,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-12-04 12:04:13,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-04 12:04:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-12-04 12:04:13,710 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2018-12-04 12:04:13,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:13,710 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-12-04 12:04:13,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-04 12:04:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-12-04 12:04:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-04 12:04:13,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:13,711 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-04 12:04:13,712 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:13,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2018-12-04 12:04:13,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:04:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:13,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:16,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:16,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:16,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:16,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:16,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:16,144 INFO L192 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 [2018-12-04 12:04:16,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:04:16,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:04:16,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-04 12:04:16,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:16,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:20,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:24,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:24,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2018-12-04 12:04:24,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:24,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-04 12:04:24,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-04 12:04:24,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2018-12-04 12:04:24,986 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2018-12-04 12:04:42,931 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-04 12:04:43,366 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-04 12:04:43,841 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-04 12:04:44,221 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:04:44,585 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:04:44,930 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:04:45,260 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:04:45,577 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:04:45,880 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:04:49,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:04:49,119 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2018-12-04 12:04:49,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-12-04 12:04:49,120 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2018-12-04 12:04:49,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:04:49,121 INFO L225 Difference]: With dead ends: 496 [2018-12-04 12:04:49,121 INFO L226 Difference]: Without dead ends: 289 [2018-12-04 12:04:49,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2018-12-04 12:04:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-04 12:04:49,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2018-12-04 12:04:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-04 12:04:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-12-04 12:04:49,166 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2018-12-04 12:04:49,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:04:49,166 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-12-04 12:04:49,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-04 12:04:49,167 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-12-04 12:04:49,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-04 12:04:49,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:04:49,167 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2018-12-04 12:04:49,168 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:04:49,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:04:49,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2018-12-04 12:04:49,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:04:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:49,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:04:49,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:04:49,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:04:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:04:51,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:51,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:04:51,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:04:51,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:04:51,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:04:51,084 INFO L192 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 [2018-12-04 12:04:51,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:04:51,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:04:51,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:04:51,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:04:51,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:04:53,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:53,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:04:53,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:04:53,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:04:53,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2018-12-04 12:04:53,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:04:53,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 12:04:53,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 12:04:53,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 12:04:53,630 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2018-12-04 12:05:01,894 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-04 12:05:02,288 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-04 12:05:02,673 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-04 12:05:03,009 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:05:03,279 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:05:03,525 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:05:03,780 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:05:04,013 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:05:04,237 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:05:04,458 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:05:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:06,756 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2018-12-04 12:05:06,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-04 12:05:06,756 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2018-12-04 12:05:06,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:06,758 INFO L225 Difference]: With dead ends: 409 [2018-12-04 12:05:06,758 INFO L226 Difference]: Without dead ends: 303 [2018-12-04 12:05:06,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2018-12-04 12:05:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-04 12:05:06,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2018-12-04 12:05:06,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-04 12:05:06,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-12-04 12:05:06,803 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2018-12-04 12:05:06,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:06,803 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-12-04 12:05:06,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 12:05:06,803 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-12-04 12:05:06,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-04 12:05:06,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:06,804 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-04 12:05:06,804 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:06,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:06,805 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2018-12-04 12:05:06,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:06,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:06,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:08,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:08,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:08,050 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:08,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:08,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:08,050 INFO L192 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 [2018-12-04 12:05:08,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:08,059 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:05:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:08,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:09,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:09,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:10,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:10,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2018-12-04 12:05:10,740 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:10,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-04 12:05:10,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-04 12:05:10,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 12:05:10,742 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2018-12-04 12:05:13,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:13,107 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2018-12-04 12:05:13,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-04 12:05:13,108 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2018-12-04 12:05:13,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:13,109 INFO L225 Difference]: With dead ends: 420 [2018-12-04 12:05:13,109 INFO L226 Difference]: Without dead ends: 201 [2018-12-04 12:05:13,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2018-12-04 12:05:13,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-04 12:05:13,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-12-04 12:05:13,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-04 12:05:13,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-12-04 12:05:13,153 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2018-12-04 12:05:13,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:13,153 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-12-04 12:05:13,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-04 12:05:13,153 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-12-04 12:05:13,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-04 12:05:13,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:13,154 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-04 12:05:13,154 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:13,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:13,155 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2018-12-04 12:05:13,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:13,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:13,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:13,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:13,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:15,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:15,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:15,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:15,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:15,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:15,381 INFO L192 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 [2018-12-04 12:05:15,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:05:15,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:05:15,448 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-04 12:05:15,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:15,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:17,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:17,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:17,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2018-12-04 12:05:17,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:17,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 12:05:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 12:05:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2018-12-04 12:05:17,634 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2018-12-04 12:05:26,202 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-04 12:05:26,628 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-04 12:05:27,029 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-04 12:05:27,311 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:05:27,590 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:05:27,856 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:05:28,110 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:05:28,388 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:05:28,675 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:05:28,900 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:05:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:31,423 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2018-12-04 12:05:31,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-04 12:05:31,423 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2018-12-04 12:05:31,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:31,425 INFO L225 Difference]: With dead ends: 424 [2018-12-04 12:05:31,425 INFO L226 Difference]: Without dead ends: 314 [2018-12-04 12:05:31,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2018-12-04 12:05:31,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-04 12:05:31,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2018-12-04 12:05:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-04 12:05:31,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-12-04 12:05:31,481 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2018-12-04 12:05:31,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:31,481 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-12-04 12:05:31,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 12:05:31,481 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-12-04 12:05:31,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-04 12:05:31,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:31,482 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-04 12:05:31,483 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:31,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:31,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2018-12-04 12:05:31,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:31,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:31,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:31,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:31,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:32,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:32,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:32,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:32,600 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:32,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:32,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:32,600 INFO L192 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 [2018-12-04 12:05:32,609 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:05:32,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:05:32,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:05:32,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:32,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:34,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:35,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:35,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:35,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2018-12-04 12:05:35,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:35,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 12:05:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 12:05:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2018-12-04 12:05:35,354 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2018-12-04 12:05:37,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:37,720 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2018-12-04 12:05:37,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-04 12:05:37,721 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2018-12-04 12:05:37,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:37,722 INFO L225 Difference]: With dead ends: 435 [2018-12-04 12:05:37,722 INFO L226 Difference]: Without dead ends: 208 [2018-12-04 12:05:37,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 12:05:37,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-04 12:05:37,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-12-04 12:05:37,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-04 12:05:37,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-12-04 12:05:37,779 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2018-12-04 12:05:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:37,780 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-12-04 12:05:37,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 12:05:37,780 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-12-04 12:05:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-04 12:05:37,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:37,781 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-04 12:05:37,781 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:37,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:37,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2018-12-04 12:05:37,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:37,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:37,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:05:37,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:37,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:40,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:40,039 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:40,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:40,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:40,040 INFO L192 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 [2018-12-04 12:05:40,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:40,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:05:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:40,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:05:42,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:42,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:05:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:42,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:05:42,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2018-12-04 12:05:42,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:05:42,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 12:05:42,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 12:05:42,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 12:05:42,461 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2018-12-04 12:05:51,537 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-04 12:05:51,978 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-04 12:05:52,397 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-04 12:05:52,692 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:05:52,985 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:05:53,266 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:05:53,534 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:05:53,804 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:05:54,115 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:05:54,397 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:05:54,635 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:05:54,867 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:05:57,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:05:57,301 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2018-12-04 12:05:57,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-04 12:05:57,301 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2018-12-04 12:05:57,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:05:57,302 INFO L225 Difference]: With dead ends: 439 [2018-12-04 12:05:57,303 INFO L226 Difference]: Without dead ends: 325 [2018-12-04 12:05:57,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 12:05:57,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-04 12:05:57,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2018-12-04 12:05:57,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-04 12:05:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-12-04 12:05:57,368 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2018-12-04 12:05:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:05:57,368 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-12-04 12:05:57,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 12:05:57,368 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-12-04 12:05:57,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-04 12:05:57,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:05:57,369 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-04 12:05:57,370 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:05:57,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:05:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2018-12-04 12:05:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:05:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:57,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:05:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:05:57,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:05:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:05:58,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:05:58,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:58,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:05:58,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:05:58,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:05:58,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:05:58,577 INFO L192 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 [2018-12-04 12:05:58,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:05:58,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:05:58,649 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-04 12:05:58,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:05:58,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:00,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:01,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:01,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2018-12-04 12:06:01,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:01,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-04 12:06:01,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-04 12:06:01,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-12-04 12:06:01,631 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2018-12-04 12:06:04,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:04,340 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2018-12-04 12:06:04,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 12:06:04,340 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2018-12-04 12:06:04,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:04,342 INFO L225 Difference]: With dead ends: 450 [2018-12-04 12:06:04,342 INFO L226 Difference]: Without dead ends: 215 [2018-12-04 12:06:04,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2018-12-04 12:06:04,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-04 12:06:04,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-04 12:06:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-04 12:06:04,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-12-04 12:06:04,397 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2018-12-04 12:06:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:04,397 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-12-04 12:06:04,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-04 12:06:04,398 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-12-04 12:06:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-04 12:06:04,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:04,399 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-04 12:06:04,399 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:04,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:04,399 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2018-12-04 12:06:04,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:04,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:04,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:04,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:06,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:06,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:06,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:06,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:06,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:06,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:06,563 INFO L192 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 [2018-12-04 12:06:06,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:06:06,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:06:06,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:06:06,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:06,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:09,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:09,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:09,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:09,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2018-12-04 12:06:09,674 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:09,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 12:06:09,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 12:06:09,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 12:06:09,675 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2018-12-04 12:06:19,749 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-04 12:06:20,287 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-04 12:06:20,725 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-04 12:06:21,048 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:06:21,350 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:06:21,651 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:06:21,945 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:06:22,231 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:06:22,502 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:06:22,757 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:06:23,002 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:06:23,241 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:06:23,469 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:06:26,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:26,064 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2018-12-04 12:06:26,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-04 12:06:26,064 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2018-12-04 12:06:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:26,065 INFO L225 Difference]: With dead ends: 454 [2018-12-04 12:06:26,066 INFO L226 Difference]: Without dead ends: 336 [2018-12-04 12:06:26,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2018-12-04 12:06:26,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-04 12:06:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2018-12-04 12:06:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-04 12:06:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-12-04 12:06:26,137 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2018-12-04 12:06:26,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:26,137 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-12-04 12:06:26,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 12:06:26,137 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-12-04 12:06:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-04 12:06:26,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:26,138 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-04 12:06:26,139 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:26,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2018-12-04 12:06:26,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:26,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:26,139 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:06:26,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:26,140 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:26,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:27,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:27,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:27,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:27,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:27,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:27,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:27,443 INFO L192 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 [2018-12-04 12:06:27,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:27,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:06:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:27,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:29,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:30,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:30,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2018-12-04 12:06:30,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:30,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 12:06:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 12:06:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 12:06:30,529 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2018-12-04 12:06:33,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:06:33,242 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2018-12-04 12:06:33,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-04 12:06:33,242 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2018-12-04 12:06:33,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:06:33,243 INFO L225 Difference]: With dead ends: 465 [2018-12-04 12:06:33,243 INFO L226 Difference]: Without dead ends: 222 [2018-12-04 12:06:33,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 12:06:33,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-04 12:06:33,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-12-04 12:06:33,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-04 12:06:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-12-04 12:06:33,297 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2018-12-04 12:06:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:06:33,297 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-12-04 12:06:33,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 12:06:33,297 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-12-04 12:06:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-04 12:06:33,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:06:33,298 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-04 12:06:33,298 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:06:33,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:06:33,299 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2018-12-04 12:06:33,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:06:33,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:33,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:06:33,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:06:33,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:06:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:06:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:35,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:06:35,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:06:35,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:06:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:06:35,749 INFO L192 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 [2018-12-04 12:06:35,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:06:35,759 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:06:35,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-04 12:06:35,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:06:35,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:06:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:41,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:06:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:06:47,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:06:47,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2018-12-04 12:06:47,559 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:06:47,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-04 12:06:47,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-04 12:06:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2018-12-04 12:06:47,561 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2018-12-04 12:07:11,813 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-04 12:07:12,375 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-04 12:07:12,972 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-04 12:07:13,461 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:07:13,944 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:07:14,425 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:07:14,885 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:07:15,341 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:07:15,780 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:07:16,243 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:07:16,638 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:07:17,013 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:07:17,381 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:07:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:21,446 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2018-12-04 12:07:21,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-12-04 12:07:21,447 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2018-12-04 12:07:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:21,448 INFO L225 Difference]: With dead ends: 591 [2018-12-04 12:07:21,448 INFO L226 Difference]: Without dead ends: 344 [2018-12-04 12:07:21,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 38.9s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2018-12-04 12:07:21,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-04 12:07:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2018-12-04 12:07:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-04 12:07:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2018-12-04 12:07:21,504 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2018-12-04 12:07:21,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:21,504 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2018-12-04 12:07:21,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-04 12:07:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2018-12-04 12:07:21,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-04 12:07:21,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:21,505 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2018-12-04 12:07:21,506 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:21,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:21,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2018-12-04 12:07:21,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:21,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:21,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:21,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:23,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:23,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:23,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:23,901 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:23,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:23,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:23,901 INFO L192 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 [2018-12-04 12:07:23,911 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:07:23,911 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:07:23,949 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:07:23,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:07:23,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:26,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:26,978 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:26,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:26,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2018-12-04 12:07:26,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:26,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 12:07:26,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 12:07:26,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2018-12-04 12:07:26,998 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2018-12-04 12:07:39,641 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-04 12:07:40,143 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-04 12:07:40,633 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-04 12:07:40,999 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:07:41,338 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:07:41,715 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:07:42,045 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:07:42,355 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:07:42,655 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:07:42,955 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:07:43,249 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:07:43,537 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:07:43,807 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:07:44,061 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:07:44,308 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:07:47,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:47,064 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2018-12-04 12:07:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-04 12:07:47,064 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2018-12-04 12:07:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:47,066 INFO L225 Difference]: With dead ends: 484 [2018-12-04 12:07:47,066 INFO L226 Difference]: Without dead ends: 358 [2018-12-04 12:07:47,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2018-12-04 12:07:47,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-04 12:07:47,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2018-12-04 12:07:47,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-04 12:07:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-12-04 12:07:47,127 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2018-12-04 12:07:47,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:47,127 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-12-04 12:07:47,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 12:07:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-12-04 12:07:47,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-04 12:07:47,129 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:47,129 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-04 12:07:47,129 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:47,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:47,129 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2018-12-04 12:07:47,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:47,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:47,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:07:47,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:47,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:48,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:48,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:48,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:48,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:48,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:48,666 INFO L192 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 [2018-12-04 12:07:48,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:48,676 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:07:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:48,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:07:53,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:53,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:07:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:54,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:07:54,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2018-12-04 12:07:54,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:07:54,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 12:07:54,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 12:07:54,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2018-12-04 12:07:54,792 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2018-12-04 12:07:57,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:07:57,275 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2018-12-04 12:07:57,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 12:07:57,276 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2018-12-04 12:07:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:07:57,277 INFO L225 Difference]: With dead ends: 495 [2018-12-04 12:07:57,277 INFO L226 Difference]: Without dead ends: 236 [2018-12-04 12:07:57,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 12:07:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-04 12:07:57,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-12-04 12:07:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-04 12:07:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-12-04 12:07:57,335 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2018-12-04 12:07:57,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:07:57,335 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-12-04 12:07:57,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 12:07:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-12-04 12:07:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-04 12:07:57,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:07:57,337 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-04 12:07:57,337 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:07:57,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:07:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2018-12-04 12:07:57,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:07:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:57,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:07:57,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:07:57,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:07:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:07:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:07:59,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:59,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:07:59,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:07:59,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:07:59,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:07:59,883 INFO L192 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 [2018-12-04 12:07:59,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:07:59,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:07:59,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-04 12:07:59,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:07:59,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:06,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:13,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:13,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2018-12-04 12:08:13,201 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:13,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-04 12:08:13,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-04 12:08:13,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 12:08:13,204 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2018-12-04 12:08:38,651 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-04 12:08:39,249 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-04 12:08:39,865 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-04 12:08:40,428 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 12:08:40,975 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:08:41,494 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:08:41,992 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:08:42,493 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:08:43,013 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:08:43,503 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:08:43,956 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:08:44,402 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:08:44,815 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:08:45,212 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:08:45,596 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:08:45,970 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:08:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:08:49,903 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2018-12-04 12:08:49,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-12-04 12:08:49,903 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2018-12-04 12:08:49,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:08:49,905 INFO L225 Difference]: With dead ends: 629 [2018-12-04 12:08:49,905 INFO L226 Difference]: Without dead ends: 366 [2018-12-04 12:08:49,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2018-12-04 12:08:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-04 12:08:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2018-12-04 12:08:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-04 12:08:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2018-12-04 12:08:49,967 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2018-12-04 12:08:49,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:08:49,967 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2018-12-04 12:08:49,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-12-04 12:08:49,967 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2018-12-04 12:08:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-04 12:08:49,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:08:49,968 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2018-12-04 12:08:49,968 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:08:49,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:08:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2018-12-04 12:08:49,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:08:49,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:49,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:08:49,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:08:49,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:08:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:08:52,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:52,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:52,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:08:52,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:08:52,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:08:52,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:08:52,684 INFO L192 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 [2018-12-04 12:08:52,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:08:52,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:08:52,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:08:52,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:08:52,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:08:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:55,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:08:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:08:56,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:08:56,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2018-12-04 12:08:56,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:08:56,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 12:08:56,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 12:08:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2018-12-04 12:08:56,041 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2018-12-04 12:09:08,009 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-04 12:09:08,586 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-04 12:09:09,164 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-04 12:09:09,540 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 12:09:09,912 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 12:09:10,271 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:09:10,622 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:09:10,961 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:09:11,310 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:09:11,633 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:09:11,953 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:09:12,258 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:09:12,556 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:09:12,844 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:09:13,122 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:09:13,391 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:09:13,688 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:09:14,007 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-04 12:09:16,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:16,621 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2018-12-04 12:09:16,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-04 12:09:16,621 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2018-12-04 12:09:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:16,622 INFO L225 Difference]: With dead ends: 514 [2018-12-04 12:09:16,623 INFO L226 Difference]: Without dead ends: 380 [2018-12-04 12:09:16,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2018-12-04 12:09:16,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-04 12:09:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2018-12-04 12:09:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-04 12:09:16,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2018-12-04 12:09:16,687 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2018-12-04 12:09:16,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:16,688 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2018-12-04 12:09:16,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 12:09:16,688 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2018-12-04 12:09:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-04 12:09:16,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:16,689 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-04 12:09:16,689 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:16,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2018-12-04 12:09:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:16,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:09:16,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:16,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:18,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:18,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:18,244 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:18,244 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:18,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:18,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:18,244 INFO L192 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 [2018-12-04 12:09:18,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:09:18,253 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:09:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:18,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:20,451 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:20,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:21,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:21,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:21,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2018-12-04 12:09:21,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 12:09:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 12:09:21,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2018-12-04 12:09:21,969 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2018-12-04 12:09:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:09:24,806 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2018-12-04 12:09:24,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-04 12:09:24,807 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2018-12-04 12:09:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:09:24,808 INFO L225 Difference]: With dead ends: 525 [2018-12-04 12:09:24,808 INFO L226 Difference]: Without dead ends: 250 [2018-12-04 12:09:24,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 12:09:24,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-04 12:09:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-12-04 12:09:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-04 12:09:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2018-12-04 12:09:24,880 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2018-12-04 12:09:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:09:24,880 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2018-12-04 12:09:24,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 12:09:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2018-12-04 12:09:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-04 12:09:24,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:09:24,881 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-04 12:09:24,882 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:09:24,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:09:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2018-12-04 12:09:24,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:09:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:24,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:09:24,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:09:24,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:09:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:09:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:27,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:27,647 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:09:27,647 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:09:27,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:09:27,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:09:27,647 INFO L192 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 [2018-12-04 12:09:27,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:09:27,656 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:09:27,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-04 12:09:27,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:09:27,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:09:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:35,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:09:42,456 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:09:42,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:09:42,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2018-12-04 12:09:42,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:09:42,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-12-04 12:09:42,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-12-04 12:09:42,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2018-12-04 12:09:42,478 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2018-12-04 12:10:08,990 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-04 12:10:09,636 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-04 12:10:10,305 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-04 12:10:10,922 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 12:10:11,524 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 12:10:12,124 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 12:10:12,676 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:10:13,225 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:10:13,754 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:10:14,283 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:10:14,780 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:10:15,266 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:10:15,750 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:10:16,233 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:10:16,680 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:10:17,102 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:10:17,507 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:10:17,905 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:10:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:10:21,860 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2018-12-04 12:10:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-12-04 12:10:21,860 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2018-12-04 12:10:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:10:21,862 INFO L225 Difference]: With dead ends: 667 [2018-12-04 12:10:21,862 INFO L226 Difference]: Without dead ends: 388 [2018-12-04 12:10:21,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 47.9s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2018-12-04 12:10:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-04 12:10:21,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2018-12-04 12:10:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-04 12:10:21,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-12-04 12:10:21,936 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2018-12-04 12:10:21,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:10:21,937 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-12-04 12:10:21,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-12-04 12:10:21,937 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-12-04 12:10:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-04 12:10:21,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:10:21,938 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2018-12-04 12:10:21,938 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:10:21,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:10:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2018-12-04 12:10:21,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:10:21,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:10:21,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:10:21,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:10:21,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:10:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:10:24,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:24,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:10:24,857 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:10:24,857 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:10:24,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:10:24,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:10:24,857 INFO L192 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 [2018-12-04 12:10:24,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:10:24,868 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:10:24,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:10:24,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:10:24,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:10:28,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:28,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:10:28,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:28,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:10:28,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2018-12-04 12:10:28,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:10:28,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 12:10:28,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 12:10:28,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2018-12-04 12:10:28,327 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2018-12-04 12:10:41,758 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-04 12:10:42,326 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-04 12:10:42,895 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-04 12:10:43,306 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-04 12:10:43,722 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 12:10:44,111 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 12:10:44,490 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 12:10:44,863 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:10:45,226 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:10:45,578 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:10:45,916 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:10:46,260 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:10:46,586 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:10:46,902 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:10:47,211 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:10:47,500 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:10:47,784 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:10:48,057 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:10:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:10:51,239 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2018-12-04 12:10:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-12-04 12:10:51,239 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2018-12-04 12:10:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:10:51,241 INFO L225 Difference]: With dead ends: 544 [2018-12-04 12:10:51,241 INFO L226 Difference]: Without dead ends: 402 [2018-12-04 12:10:51,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2018-12-04 12:10:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-04 12:10:51,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2018-12-04 12:10:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-04 12:10:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2018-12-04 12:10:51,314 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2018-12-04 12:10:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:10:51,315 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2018-12-04 12:10:51,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 12:10:51,315 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2018-12-04 12:10:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-04 12:10:51,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:10:51,316 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-04 12:10:51,317 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:10:51,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:10:51,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2018-12-04 12:10:51,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:10:51,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:10:51,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:10:51,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:10:51,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:10:51,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:10:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:53,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:10:53,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:10:53,012 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:10:53,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:10:53,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:10:53,012 INFO L192 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 [2018-12-04 12:10:53,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:10:53,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:10:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:10:53,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:10:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:55,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:10:56,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:10:56,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:10:56,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2018-12-04 12:10:56,844 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:10:56,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 12:10:56,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 12:10:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2018-12-04 12:10:56,845 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2018-12-04 12:10:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:10:59,644 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2018-12-04 12:10:59,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-04 12:10:59,645 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2018-12-04 12:10:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:10:59,646 INFO L225 Difference]: With dead ends: 555 [2018-12-04 12:10:59,646 INFO L226 Difference]: Without dead ends: 264 [2018-12-04 12:10:59,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 12:10:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-04 12:10:59,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-12-04 12:10:59,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-04 12:10:59,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2018-12-04 12:10:59,716 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2018-12-04 12:10:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:10:59,716 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2018-12-04 12:10:59,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 12:10:59,716 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2018-12-04 12:10:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-04 12:10:59,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:10:59,717 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-04 12:10:59,717 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:10:59,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:10:59,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2018-12-04 12:10:59,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:10:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:10:59,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:10:59,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:10:59,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:10:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:11:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:11:02,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:11:02,863 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:11:02,863 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:11:02,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:11:02,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:11:02,864 INFO L192 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 [2018-12-04 12:11:02,887 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:11:02,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:11:03,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-04 12:11:03,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:11:03,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:11:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:11:10,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:11:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:11:18,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:11:18,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2018-12-04 12:11:18,498 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:11:18,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-04 12:11:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-04 12:11:18,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2018-12-04 12:11:18,500 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2018-12-04 12:11:48,287 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-04 12:11:49,019 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-04 12:11:49,776 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-04 12:11:50,443 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-04 12:11:51,106 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-04 12:11:51,755 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 12:11:52,372 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 12:11:52,987 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 12:11:53,572 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:11:54,153 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:11:54,705 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:11:55,246 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:11:55,777 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:11:56,313 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:11:56,817 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:11:57,295 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:11:57,747 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:11:58,182 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:11:58,622 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:11:59,034 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:12:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:12:03,205 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2018-12-04 12:12:03,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2018-12-04 12:12:03,205 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2018-12-04 12:12:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:12:03,207 INFO L225 Difference]: With dead ends: 705 [2018-12-04 12:12:03,207 INFO L226 Difference]: Without dead ends: 410 [2018-12-04 12:12:03,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 52.7s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2018-12-04 12:12:03,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-04 12:12:03,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2018-12-04 12:12:03,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-04 12:12:03,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2018-12-04 12:12:03,304 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2018-12-04 12:12:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:12:03,304 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2018-12-04 12:12:03,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-04 12:12:03,304 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2018-12-04 12:12:03,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-04 12:12:03,305 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:12:03,305 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2018-12-04 12:12:03,305 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:12:03,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:12:03,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2018-12-04 12:12:03,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:12:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:12:03,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:12:03,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:12:03,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:12:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:12:06,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:06,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:12:06,418 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:12:06,418 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:12:06,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:12:06,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:12:06,418 INFO L192 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 [2018-12-04 12:12:06,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 12:12:06,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 12:12:06,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 12:12:06,471 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:12:06,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:12:09,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:09,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:12:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:10,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:12:10,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2018-12-04 12:12:10,156 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:12:10,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-04 12:12:10,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-04 12:12:10,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2018-12-04 12:12:10,157 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2018-12-04 12:12:25,590 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-12-04 12:12:26,199 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-12-04 12:12:26,801 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-04 12:12:27,240 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-04 12:12:27,684 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-04 12:12:28,112 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-04 12:12:28,528 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-04 12:12:28,939 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-04 12:12:29,337 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-04 12:12:29,726 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-04 12:12:30,118 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-04 12:12:30,478 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-04 12:12:30,836 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-04 12:12:31,187 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-04 12:12:31,532 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-04 12:12:31,862 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-04 12:12:32,191 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-04 12:12:32,501 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-04 12:12:32,804 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-04 12:12:33,094 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-04 12:12:33,372 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-04 12:12:36,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:12:36,418 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2018-12-04 12:12:36,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-12-04 12:12:36,418 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2018-12-04 12:12:36,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:12:36,420 INFO L225 Difference]: With dead ends: 574 [2018-12-04 12:12:36,420 INFO L226 Difference]: Without dead ends: 424 [2018-12-04 12:12:36,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2018-12-04 12:12:36,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-04 12:12:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2018-12-04 12:12:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-04 12:12:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2018-12-04 12:12:36,498 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2018-12-04 12:12:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:12:36,498 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2018-12-04 12:12:36,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-04 12:12:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2018-12-04 12:12:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-04 12:12:36,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:12:36,499 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-04 12:12:36,499 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:12:36,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:12:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2018-12-04 12:12:36,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:12:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:12:36,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 12:12:36,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:12:36,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:12:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:12:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:38,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:12:38,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:12:38,360 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:12:38,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:12:38,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:12:38,361 INFO L192 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 [2018-12-04 12:12:38,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:12:38,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 12:12:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:12:38,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:12:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:40,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 12:12:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:42,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 12:12:42,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2018-12-04 12:12:42,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 12:12:42,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-04 12:12:42,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-04 12:12:42,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2018-12-04 12:12:42,519 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2018-12-04 12:12:45,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 12:12:45,637 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2018-12-04 12:12:45,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 12:12:45,638 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2018-12-04 12:12:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 12:12:45,640 INFO L225 Difference]: With dead ends: 585 [2018-12-04 12:12:45,640 INFO L226 Difference]: Without dead ends: 278 [2018-12-04 12:12:45,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 12:12:45,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-04 12:12:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-12-04 12:12:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-04 12:12:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-12-04 12:12:45,728 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2018-12-04 12:12:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 12:12:45,728 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-12-04 12:12:45,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-04 12:12:45,728 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-12-04 12:12:45,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-04 12:12:45,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 12:12:45,729 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-04 12:12:45,729 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 12:12:45,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 12:12:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2018-12-04 12:12:45,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 12:12:45,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:12:45,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 12:12:45,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 12:12:45,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 12:12:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 12:12:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:49,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:12:49,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 12:12:49,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 12:12:49,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 12:12:49,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 12:12:49,030 INFO L192 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 [2018-12-04 12:12:49,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 12:12:49,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 12:12:49,127 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-04 12:12:49,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 12:12:49,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 12:12:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 2888 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 12:12:57,887 INFO L316 TraceCheckSpWp]: Computing backward predicates...