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_compound_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:31:46,167 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:31:46,171 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:31:46,187 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:31:46,188 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:31:46,189 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:31:46,190 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:31:46,192 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:31:46,194 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:31:46,194 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:31:46,195 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:31:46,196 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:31:46,197 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:31:46,198 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:31:46,199 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:31:46,200 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:31:46,200 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:31:46,202 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:31:46,204 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:31:46,206 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:31:46,207 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:31:46,208 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:31:46,214 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:31:46,214 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:31:46,214 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:31:46,215 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:31:46,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:31:46,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:31:46,219 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:31:46,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:31:46,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:31:46,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:31:46,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:31:46,222 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:31:46,223 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:31:46,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:31:46,224 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:31:46,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:31:46,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:31:46,238 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:31:46,238 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:31:46,239 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:31:46,239 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:31:46,239 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:31:46,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:31:46,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:31:46,240 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:31:46,240 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:31:46,240 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:31:46,240 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:31:46,241 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:31:46,241 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:31:46,241 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:31:46,241 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:31:46,242 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:31:46,242 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:31:46,242 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:31:46,242 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:31:46,242 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:31:46,243 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:31:46,243 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:31:46,243 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:31:46,243 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:31:46,243 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:31:46,243 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:31:46,244 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:31:46,244 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:31:46,244 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:31:46,244 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:31:46,244 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:31:46,245 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:31:46,245 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:31:46,245 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:31:46,245 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:31:46,245 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:31:46,247 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:31:46,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:31:46,313 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:31:46,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:31:46,321 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:31:46,322 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:31:46,322 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_2.i_3.bpl [2018-12-03 17:31:46,323 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_2.i_3.bpl' [2018-12-03 17:31:46,361 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:31:46,362 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:31:46,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:31:46,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:31:46,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:31:46,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:31:46,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:31:46,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:31:46,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:31:46,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,419 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,420 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/1) ... [2018-12-03 17:31:46,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:31:46,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:31:46,423 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:31:46,423 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:31:46,424 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (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-03 17:31:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:31:46,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:31:46,713 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:31:46,713 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 17:31:46,718 INFO L202 PluginConnector]: Adding new model count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:31:46 BoogieIcfgContainer [2018-12-03 17:31:46,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:31:46,719 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:31:46,719 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:31:46,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:31:46,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:31:46" (1/2) ... [2018-12-03 17:31:46,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@250e17e2 and model type count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:31:46, skipping insertion in model container [2018-12-03 17:31:46,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:31:46" (2/2) ... [2018-12-03 17:31:46,727 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2.i_3.bpl [2018-12-03 17:31:46,738 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:31:46,749 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:31:46,767 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:31:46,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:31:46,799 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:31:46,799 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:31:46,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:31:46,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:31:46,800 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:31:46,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:31:46,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:31:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 17:31:46,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 17:31:46,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:46,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 17:31:46,826 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:46,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 17:31:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:46,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:46,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:46,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:46,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:46,992 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-03 17:31:46,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:31:46,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 17:31:46,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:31:46,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 17:31:47,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 17:31:47,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:31:47,014 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 17:31:47,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:47,059 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 17:31:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 17:31:47,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 17:31:47,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:47,073 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:31:47,073 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 17:31:47,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 17:31:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 17:31:47,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 17:31:47,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 17:31:47,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 17:31:47,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 17:31:47,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:47,126 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 17:31:47,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 17:31:47,126 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 17:31:47,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 17:31:47,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:47,126 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 17:31:47,127 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:47,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:47,127 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 17:31:47,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:47,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:47,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:47,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:47,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:47,280 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-03 17:31:47,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:47,282 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:47,284 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 17:31:47,286 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 17:31:47,405 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:31:47,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:31:47,633 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:31:47,635 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 17:31:47,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:47,653 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:31:47,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:47,654 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-03 17:31:47,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:47,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:47,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:47,703 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-03 17:31:47,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:47,798 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-03 17:31:47,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:47,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 17:31:47,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:47,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:31:47,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:31:47,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:31:47,821 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 17:31:47,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:47,859 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 17:31:47,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:31:47,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 17:31:47,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:47,861 INFO L225 Difference]: With dead ends: 8 [2018-12-03 17:31:47,861 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 17:31:47,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 17:31:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 17:31:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 17:31:47,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 17:31:47,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 17:31:47,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 17:31:47,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:47,865 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 17:31:47,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:31:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 17:31:47,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 17:31:47,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:47,866 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 17:31:47,867 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:47,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:47,867 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 17:31:47,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:47,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:47,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:47,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:47,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:47,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:47,949 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:47,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:47,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:47,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 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-03 17:31:47,962 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:47,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:47,970 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 17:31:47,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:47,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:47,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:48,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:48,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 17:31:48,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:48,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 17:31:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 17:31:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:31:48,073 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 17:31:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:48,119 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 17:31:48,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:31:48,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 17:31:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:48,120 INFO L225 Difference]: With dead ends: 9 [2018-12-03 17:31:48,120 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 17:31:48,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 17:31:48,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 17:31:48,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 17:31:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 17:31:48,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 17:31:48,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 17:31:48,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:48,124 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 17:31:48,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 17:31:48,124 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 17:31:48,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:31:48,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:48,125 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 17:31:48,125 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:48,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:48,126 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 17:31:48,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:48,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:48,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:48,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:48,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:48,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:48,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:48,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:48,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:48,223 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-03 17:31:48,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:48,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:48,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:48,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:48,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:48,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:48,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:48,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:48,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 17:31:48,599 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:48,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 17:31:48,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 17:31:48,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:31:48,601 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 17:31:48,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:48,639 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 17:31:48,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 17:31:48,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 17:31:48,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:48,642 INFO L225 Difference]: With dead ends: 10 [2018-12-03 17:31:48,642 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 17:31:48,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:31:48,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 17:31:48,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 17:31:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 17:31:48,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 17:31:48,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 17:31:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:48,646 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 17:31:48,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 17:31:48,646 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 17:31:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 17:31:48,647 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:48,647 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 17:31:48,647 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:48,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:48,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 17:31:48,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:48,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:48,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:48,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:48,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:48,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:48,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:48,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:48,805 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:48,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:48,805 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-03 17:31:48,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:48,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:48,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:48,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:49,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 17:31:49,079 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:49,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 17:31:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 17:31:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:31:49,080 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 17:31:49,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:49,104 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 17:31:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 17:31:49,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 17:31:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:49,108 INFO L225 Difference]: With dead ends: 11 [2018-12-03 17:31:49,108 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 17:31:49,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:31:49,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 17:31:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 17:31:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:31:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 17:31:49,113 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 17:31:49,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:49,113 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 17:31:49,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 17:31:49,113 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 17:31:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:31:49,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:49,114 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 17:31:49,114 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:49,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:49,115 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 17:31:49,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:49,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:49,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:49,222 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:49,222 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:49,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:49,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:49,222 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-03 17:31:49,232 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:49,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:49,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 17:31:49,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:49,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:49,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 17:31:49,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:49,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 17:31:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 17:31:49,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:31:49,739 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 17:31:49,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:49,775 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 17:31:49,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 17:31:49,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 17:31:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:49,777 INFO L225 Difference]: With dead ends: 12 [2018-12-03 17:31:49,777 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:31:49,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:31:49,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:31:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 17:31:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 17:31:49,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 17:31:49,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 17:31:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:49,781 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 17:31:49,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 17:31:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 17:31:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 17:31:49,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:49,782 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 17:31:49,782 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:49,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:49,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 17:31:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:49,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:49,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:49,908 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:49,909 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:49,909 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:49,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:49,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:49,910 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-03 17:31:49,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:49,921 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:49,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:49,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:49,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:49,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:50,097 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:50,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 17:31:50,116 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:50,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:31:50,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:31:50,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:31:50,118 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 17:31:50,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:50,143 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 17:31:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:31:50,144 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 17:31:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:50,145 INFO L225 Difference]: With dead ends: 13 [2018-12-03 17:31:50,146 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:31:50,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:31:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:31:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:31:50,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:31:50,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 17:31:50,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 17:31:50,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:50,150 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 17:31:50,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:31:50,150 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 17:31:50,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:31:50,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:50,150 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 17:31:50,151 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:50,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:50,151 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 17:31:50,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:50,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:50,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:50,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:50,298 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:50,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:50,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:50,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:50,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:50,302 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-03 17:31:50,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:50,319 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:50,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:50,337 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:50,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 17:31:50,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:50,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:31:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:31:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:31:50,637 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 17:31:50,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:50,675 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 17:31:50,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:31:50,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 17:31:50,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:50,679 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:31:50,680 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 17:31:50,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:31:50,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 17:31:50,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 17:31:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 17:31:50,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 17:31:50,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 17:31:50,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:50,684 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 17:31:50,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:31:50,684 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 17:31:50,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 17:31:50,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:50,684 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 17:31:50,685 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:50,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 17:31:50,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:50,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:50,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:50,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:50,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:50,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:50,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:50,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:50,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:50,795 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-03 17:31:50,804 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:50,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:50,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 17:31:50,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:50,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:50,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:50,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:51,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:51,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 17:31:51,209 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:51,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 17:31:51,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 17:31:51,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:31:51,210 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 17:31:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:51,260 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 17:31:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:31:51,260 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 17:31:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:51,260 INFO L225 Difference]: With dead ends: 15 [2018-12-03 17:31:51,261 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 17:31:51,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:31:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 17:31:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 17:31:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 17:31:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 17:31:51,263 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 17:31:51,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:51,264 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 17:31:51,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 17:31:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 17:31:51,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 17:31:51,264 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:51,264 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 17:31:51,265 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:51,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:51,265 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2018-12-03 17:31:51,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:51,266 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:51,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:51,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:51,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:51,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:51,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:51,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:51,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:51,363 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-03 17:31:51,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:51,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:51,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:51,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:51,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:51,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:51,626 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:51,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:51,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 17:31:51,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:51,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:31:51,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:31:51,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:31:51,647 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 17:31:51,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:51,667 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 17:31:51,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 17:31:51,667 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 17:31:51,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:51,668 INFO L225 Difference]: With dead ends: 16 [2018-12-03 17:31:51,668 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 17:31:51,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 17:31:51,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 17:31:51,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 17:31:51,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 17:31:51,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 17:31:51,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 17:31:51,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:51,672 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 17:31:51,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:31:51,673 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 17:31:51,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 17:31:51,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:51,673 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 17:31:51,673 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:51,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:51,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2018-12-03 17:31:51,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:51,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:51,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:51,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:51,675 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:51,786 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:51,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:51,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:51,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:51,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:51,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:51,787 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-03 17:31:51,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:51,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:51,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:51,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 17:31:52,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:52,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 17:31:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 17:31:52,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:31:52,118 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 17:31:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:52,147 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 17:31:52,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:31:52,148 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 17:31:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:52,149 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:31:52,149 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:31:52,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:31:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:31:52,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:31:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:31:52,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 17:31:52,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 17:31:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:52,154 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 17:31:52,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 17:31:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 17:31:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:31:52,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:52,155 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 17:31:52,155 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:52,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:52,155 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2018-12-03 17:31:52,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:52,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:52,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:52,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:52,416 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:52,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:52,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:52,417 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:52,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:52,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:52,417 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-03 17:31:52,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:52,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:52,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 17:31:52,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:52,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:52,458 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:52,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:52,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:52,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 17:31:52,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:52,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:31:52,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:31:52,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:31:52,994 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 17:31:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:53,023 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 17:31:53,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:31:53,024 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 17:31:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:53,024 INFO L225 Difference]: With dead ends: 18 [2018-12-03 17:31:53,024 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 17:31:53,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 17:31:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 17:31:53,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 17:31:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 17:31:53,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 17:31:53,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 17:31:53,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:53,028 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 17:31:53,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:31:53,028 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 17:31:53,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 17:31:53,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:53,029 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 17:31:53,029 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:53,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:53,029 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2018-12-03 17:31:53,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:53,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:53,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:53,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:53,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:53,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:53,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:53,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:53,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:53,163 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-03 17:31:53,173 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:53,173 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:53,197 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:53,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:53,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:53,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:53,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:53,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 17:31:53,479 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:53,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 17:31:53,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 17:31:53,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:31:53,481 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 17:31:53,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:53,554 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 17:31:53,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:31:53,559 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 17:31:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:53,560 INFO L225 Difference]: With dead ends: 19 [2018-12-03 17:31:53,560 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 17:31:53,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:31:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 17:31:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 17:31:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 17:31:53,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 17:31:53,564 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 17:31:53,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:53,564 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 17:31:53,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 17:31:53,564 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 17:31:53,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 17:31:53,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:53,565 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 17:31:53,565 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:53,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:53,565 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2018-12-03 17:31:53,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:53,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:53,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:53,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:53,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:53,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:54,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:54,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:54,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:54,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:54,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:54,105 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-03 17:31:54,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:54,116 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:54,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:54,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:54,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:54,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 17:31:54,593 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:54,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:31:54,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:31:54,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:31:54,594 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 17:31:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:54,627 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 17:31:54,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 17:31:54,631 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 17:31:54,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:54,631 INFO L225 Difference]: With dead ends: 20 [2018-12-03 17:31:54,632 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 17:31:54,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:31:54,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 17:31:54,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 17:31:54,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 17:31:54,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 17:31:54,636 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 17:31:54,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:54,636 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 17:31:54,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:31:54,636 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 17:31:54,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 17:31:54,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:54,637 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 17:31:54,637 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:54,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:54,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2018-12-03 17:31:54,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:54,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:54,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:54,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:54,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:54,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:54,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:54,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:54,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:54,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:54,942 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-03 17:31:54,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:54,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:54,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:31:54,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:54,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:54,982 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:54,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:55,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:55,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 17:31:55,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:55,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:31:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:31:55,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:31:55,578 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 17:31:55,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:55,607 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 17:31:55,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:31:55,607 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 17:31:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:55,608 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:31:55,608 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:31:55,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:31:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:31:55,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:31:55,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:31:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 17:31:55,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 17:31:55,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:55,612 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 17:31:55,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:31:55,612 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 17:31:55,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:31:55,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:55,613 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 17:31:55,613 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:55,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:55,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2018-12-03 17:31:55,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:55,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:55,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:55,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:55,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:55,844 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:55,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:55,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:55,845 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:55,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:55,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:55,845 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-03 17:31:55,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:31:55,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:31:55,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:31:55,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:55,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:55,875 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:55,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:56,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:56,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 17:31:56,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:56,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:31:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:31:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:31:56,571 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 17:31:56,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:56,608 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 17:31:56,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:31:56,608 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 17:31:56,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:56,609 INFO L225 Difference]: With dead ends: 22 [2018-12-03 17:31:56,610 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 17:31:56,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 17:31:56,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 17:31:56,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 17:31:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 17:31:56,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 17:31:56,614 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 17:31:56,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:56,614 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 17:31:56,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:31:56,614 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 17:31:56,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 17:31:56,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:56,615 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 17:31:56,615 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:56,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:56,615 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2018-12-03 17:31:56,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:56,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:56,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:56,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:56,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:57,321 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:57,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:57,322 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:57,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:57,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:57,323 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-03 17:31:57,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:57,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:31:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:57,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:57,367 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:57,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:58,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:58,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 17:31:58,470 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:58,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 17:31:58,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 17:31:58,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:31:58,472 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 17:31:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:58,494 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 17:31:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:31:58,494 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 17:31:58,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:58,495 INFO L225 Difference]: With dead ends: 23 [2018-12-03 17:31:58,495 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:31:58,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:31:58,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:31:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:31:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:31:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 17:31:58,498 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 17:31:58,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:58,498 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 17:31:58,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 17:31:58,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 17:31:58,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:31:58,499 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:58,499 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 17:31:58,499 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:58,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:58,500 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2018-12-03 17:31:58,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:58,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:31:58,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:58,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:31:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:58,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:58,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:31:58,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:31:58,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:31:58,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:31:58,696 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-03 17:31:58,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:31:58,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:31:58,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:31:58,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:31:58,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:31:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:58,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:31:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:31:59,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:31:59,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 17:31:59,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:31:59,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:31:59,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:31:59,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:31:59,773 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 17:31:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:31:59,809 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 17:31:59,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 17:31:59,809 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 17:31:59,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:31:59,810 INFO L225 Difference]: With dead ends: 24 [2018-12-03 17:31:59,810 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 17:31:59,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 17:31:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 17:31:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 17:31:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 17:31:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 17:31:59,815 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 17:31:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:31:59,815 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 17:31:59,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:31:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 17:31:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 17:31:59,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:31:59,816 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 17:31:59,816 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:31:59,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:31:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2018-12-03 17:31:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:31:59,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:59,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:31:59,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:31:59,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:31:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:00,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:00,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:00,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:00,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:00,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:00,532 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-03 17:32:00,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:00,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:00,578 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:00,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:00,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:00,587 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:00,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:01,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:01,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 17:32:01,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:01,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 17:32:01,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 17:32:01,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:32:01,242 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 17:32:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:01,276 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 17:32:01,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:32:01,276 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 17:32:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:01,277 INFO L225 Difference]: With dead ends: 25 [2018-12-03 17:32:01,277 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 17:32:01,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:32:01,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 17:32:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 17:32:01,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 17:32:01,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 17:32:01,282 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 17:32:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:01,282 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 17:32:01,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 17:32:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 17:32:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 17:32:01,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:01,283 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 17:32:01,284 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:01,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2018-12-03 17:32:01,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:01,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:01,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:01,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:01,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:01,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:01,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:01,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:01,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:01,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:01,485 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-03 17:32:01,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:01,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:01,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:01,514 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:01,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:02,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:02,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 17:32:02,040 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:02,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:32:02,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:32:02,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:32:02,042 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 17:32:02,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:02,112 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 17:32:02,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:32:02,114 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 17:32:02,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:02,114 INFO L225 Difference]: With dead ends: 26 [2018-12-03 17:32:02,115 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 17:32:02,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:32:02,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 17:32:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 17:32:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 17:32:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 17:32:02,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 17:32:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:02,118 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 17:32:02,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:32:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 17:32:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 17:32:02,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:02,119 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 17:32:02,119 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:02,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2018-12-03 17:32:02,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:02,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:02,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:02,468 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:02,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:02,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:02,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:02,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:02,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:02,469 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-03 17:32:02,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:02,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:02,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 17:32:02,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:02,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:02,538 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:02,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:03,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:03,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 17:32:03,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:03,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:32:03,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:32:03,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:32:03,448 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 17:32:03,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:03,486 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 17:32:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:32:03,487 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 17:32:03,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:03,487 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:32:03,488 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 17:32:03,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:32:03,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 17:32:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 17:32:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:32:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 17:32:03,491 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 17:32:03,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:03,491 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 17:32:03,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:32:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 17:32:03,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:32:03,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:03,492 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 17:32:03,492 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:03,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:03,493 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2018-12-03 17:32:03,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:03,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:03,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:03,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:03,743 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:03,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:03,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:03,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:03,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:03,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:03,744 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-03 17:32:03,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:03,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:03,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:03,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:03,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:03,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:04,439 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:04,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:04,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 17:32:04,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:04,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:32:04,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:32:04,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:32:04,462 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 17:32:04,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:04,519 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 17:32:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 17:32:04,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 17:32:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:04,522 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:32:04,523 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:32:04,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 17:32:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:32:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 17:32:04,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 17:32:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 17:32:04,526 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 17:32:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:04,526 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 17:32:04,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:32:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 17:32:04,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 17:32:04,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:04,527 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 17:32:04,528 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:04,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:04,528 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2018-12-03 17:32:04,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:04,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:04,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:04,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:04,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:04,824 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:04,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:04,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:04,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:04,825 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-03 17:32:04,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:04,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:04,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:04,853 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:04,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:05,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:05,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 17:32:05,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:05,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 17:32:05,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 17:32:05,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:32:05,478 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 17:32:05,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:05,567 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 17:32:05,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:32:05,569 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 17:32:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:05,570 INFO L225 Difference]: With dead ends: 29 [2018-12-03 17:32:05,570 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:32:05,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:32:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:32:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:32:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:32:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 17:32:05,576 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 17:32:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:05,576 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 17:32:05,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 17:32:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 17:32:05,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:32:05,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:05,577 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 17:32:05,578 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:05,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:05,578 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2018-12-03 17:32:05,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:05,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:05,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:05,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:05,955 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:05,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:05,955 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:05,955 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:05,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:05,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:05,955 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-03 17:32:05,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:05,967 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:05,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 17:32:05,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:05,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:05,991 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:05,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:06,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:06,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 17:32:06,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:06,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:32:06,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:32:06,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:32:06,748 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 17:32:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:06,795 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 17:32:06,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:32:06,795 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 17:32:06,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:06,796 INFO L225 Difference]: With dead ends: 30 [2018-12-03 17:32:06,796 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 17:32:06,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 17:32:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 17:32:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 17:32:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 17:32:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 17:32:06,802 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 17:32:06,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:06,802 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 17:32:06,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:32:06,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 17:32:06,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 17:32:06,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:06,803 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 17:32:06,803 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:06,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:06,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2018-12-03 17:32:06,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:06,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:06,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:06,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:06,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:07,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:07,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:07,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:07,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:07,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:07,245 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-03 17:32:07,254 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:07,254 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:07,274 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:07,274 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:07,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:07,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:08,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:08,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 17:32:08,548 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:08,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 17:32:08,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 17:32:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:32:08,550 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 17:32:08,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:08,609 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 17:32:08,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:32:08,610 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 17:32:08,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:08,611 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:32:08,611 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:32:08,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:32:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:32:08,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:32:08,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:32:08,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 17:32:08,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 17:32:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:08,616 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 17:32:08,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 17:32:08,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 17:32:08,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:32:08,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:08,617 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 17:32:08,618 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:08,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:08,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2018-12-03 17:32:08,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:08,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:08,619 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:08,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:08,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:09,227 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:09,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:09,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:09,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:09,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:09,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:09,228 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-03 17:32:09,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:09,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:09,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:09,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:10,603 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:10,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:10,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 17:32:10,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:10,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:32:10,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:32:10,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:32:10,624 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 17:32:10,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:10,719 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 17:32:10,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 17:32:10,720 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 17:32:10,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:10,720 INFO L225 Difference]: With dead ends: 32 [2018-12-03 17:32:10,720 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 17:32:10,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:32:10,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 17:32:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 17:32:10,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 17:32:10,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 17:32:10,724 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 17:32:10,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:10,724 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 17:32:10,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:32:10,725 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 17:32:10,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 17:32:10,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:10,725 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 17:32:10,726 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:10,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:10,726 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2018-12-03 17:32:10,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:10,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:10,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:10,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:10,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:11,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:11,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:11,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:11,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:11,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:11,363 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-03 17:32:11,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:11,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:11,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:32:11,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:11,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:11,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:12,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 17:32:12,236 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:12,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:32:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:32:12,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:32:12,238 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 17:32:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:12,463 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 17:32:12,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:32:12,463 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 17:32:12,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:12,463 INFO L225 Difference]: With dead ends: 33 [2018-12-03 17:32:12,463 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 17:32:12,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:32:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 17:32:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 17:32:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 17:32:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 17:32:12,468 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 17:32:12,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:12,469 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 17:32:12,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:32:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 17:32:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 17:32:12,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:12,469 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 17:32:12,470 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:12,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2018-12-03 17:32:12,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:12,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:12,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:12,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:13,459 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:13,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:13,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:13,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:13,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:13,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:13,459 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-03 17:32:13,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:13,469 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:13,480 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:13,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:13,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:13,490 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:13,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:14,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:14,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 17:32:14,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:14,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:32:14,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:32:14,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:32:14,438 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 17:32:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:14,470 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 17:32:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:32:14,470 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 17:32:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:14,471 INFO L225 Difference]: With dead ends: 34 [2018-12-03 17:32:14,471 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 17:32:14,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 17:32:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 17:32:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 17:32:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 17:32:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 17:32:14,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 17:32:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:14,477 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 17:32:14,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:32:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 17:32:14,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 17:32:14,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:14,484 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 17:32:14,485 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:14,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:14,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2018-12-03 17:32:14,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:14,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:14,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:14,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:14,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:14,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:14,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:14,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:14,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:14,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:14,875 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-03 17:32:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:14,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:14,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:14,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:15,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:15,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 17:32:15,876 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:15,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 17:32:15,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 17:32:15,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:32:15,877 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 17:32:15,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:15,954 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 17:32:15,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:32:15,955 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 17:32:15,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:15,955 INFO L225 Difference]: With dead ends: 35 [2018-12-03 17:32:15,956 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 17:32:15,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:32:15,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 17:32:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 17:32:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:32:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 17:32:15,960 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 17:32:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:15,961 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 17:32:15,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 17:32:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 17:32:15,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:32:15,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:15,962 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 17:32:15,962 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:15,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2018-12-03 17:32:15,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:15,963 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:16,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:16,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:16,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:16,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:16,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:16,745 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-03 17:32:16,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:16,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:16,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:32:16,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:16,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:16,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:18,022 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:18,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:18,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 17:32:18,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:18,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:32:18,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:32:18,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:32:18,042 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 17:32:18,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:18,151 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 17:32:18,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 17:32:18,151 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 17:32:18,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:18,152 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:32:18,152 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:32:18,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 17:32:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:32:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 17:32:18,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 17:32:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 17:32:18,154 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 17:32:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:18,155 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 17:32:18,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:32:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 17:32:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 17:32:18,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:18,155 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 17:32:18,155 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:18,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2018-12-03 17:32:18,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:18,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:18,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:18,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:18,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,675 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:18,675 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:18,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:18,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:18,675 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-03 17:32:18,686 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:18,687 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:18,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:18,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:18,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:18,712 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:18,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:20,023 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:20,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:20,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 17:32:20,042 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:20,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 17:32:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 17:32:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:32:20,043 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 17:32:20,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:20,096 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 17:32:20,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:32:20,097 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 17:32:20,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:20,098 INFO L225 Difference]: With dead ends: 37 [2018-12-03 17:32:20,098 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:32:20,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:32:20,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:32:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:32:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:32:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 17:32:20,102 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 17:32:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:20,102 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 17:32:20,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 17:32:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 17:32:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:32:20,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:20,103 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 17:32:20,103 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2018-12-03 17:32:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:20,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:20,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:20,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:20,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:20,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:20,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:20,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:20,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:20,633 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-03 17:32:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:20,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:20,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:20,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:21,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:21,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 17:32:21,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:21,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:32:21,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:32:21,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:32:21,825 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 17:32:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:21,892 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 17:32:21,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:32:21,892 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 17:32:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:21,893 INFO L225 Difference]: With dead ends: 38 [2018-12-03 17:32:21,893 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 17:32:21,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:32:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 17:32:21,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 17:32:21,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 17:32:21,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 17:32:21,898 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 17:32:21,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:21,898 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 17:32:21,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:32:21,899 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 17:32:21,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 17:32:21,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:21,899 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 17:32:21,899 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:21,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:21,900 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2018-12-03 17:32:21,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:21,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:21,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:21,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:21,901 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:22,464 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:22,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:22,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:22,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:22,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:22,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:22,466 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-03 17:32:22,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:22,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:22,494 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 17:32:22,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:22,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:22,503 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:22,503 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:23,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:23,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 17:32:23,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:23,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:32:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:32:23,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:32:23,998 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 17:32:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:24,036 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 17:32:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:32:24,036 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 17:32:24,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:24,037 INFO L225 Difference]: With dead ends: 39 [2018-12-03 17:32:24,037 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:32:24,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:32:24,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:32:24,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:32:24,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:32:24,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 17:32:24,044 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 17:32:24,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:24,044 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 17:32:24,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:32:24,044 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 17:32:24,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:32:24,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:24,045 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 17:32:24,045 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:24,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:24,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2018-12-03 17:32:24,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:24,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:24,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:24,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:24,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:24,619 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:24,619 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:24,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:24,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:24,619 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-03 17:32:24,628 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:24,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:24,644 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:24,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:24,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:24,654 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:24,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:25,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:25,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 17:32:25,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:25,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:32:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:32:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:32:25,957 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 17:32:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:26,011 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 17:32:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 17:32:26,011 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 17:32:26,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:26,012 INFO L225 Difference]: With dead ends: 40 [2018-12-03 17:32:26,012 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 17:32:26,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 17:32:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 17:32:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 17:32:26,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 17:32:26,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 17:32:26,016 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 17:32:26,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:26,017 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 17:32:26,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:32:26,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 17:32:26,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 17:32:26,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:26,017 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 17:32:26,018 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:26,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:26,018 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2018-12-03 17:32:26,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:26,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:26,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:26,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:26,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:26,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:26,603 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:26,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:26,604 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:26,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:26,604 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-03 17:32:26,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:26,615 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:26,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:26,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:27,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:27,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 17:32:27,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:27,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 17:32:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 17:32:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:32:27,999 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 17:32:28,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:28,063 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 17:32:28,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:32:28,064 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 17:32:28,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:28,064 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:32:28,064 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 17:32:28,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:32:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 17:32:28,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 17:32:28,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 17:32:28,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 17:32:28,069 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 17:32:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:28,069 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 17:32:28,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 17:32:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 17:32:28,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 17:32:28,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:28,070 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 17:32:28,070 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:28,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:28,070 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2018-12-03 17:32:28,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:28,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:28,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:28,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:28,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:28,906 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:28,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:28,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:28,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:28,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:28,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:28,907 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-03 17:32:28,917 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:28,917 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:28,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 17:32:28,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:28,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:28,946 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:30,799 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:30,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:30,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 17:32:30,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:30,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:32:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:32:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:32:30,819 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 17:32:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:30,869 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 17:32:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:32:30,870 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 17:32:30,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:30,871 INFO L225 Difference]: With dead ends: 42 [2018-12-03 17:32:30,871 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 17:32:30,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:32:30,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 17:32:30,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 17:32:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 17:32:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 17:32:30,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 17:32:30,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:30,875 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 17:32:30,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:32:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 17:32:30,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 17:32:30,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:30,876 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 17:32:30,876 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:30,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:30,876 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2018-12-03 17:32:30,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:30,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:30,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:30,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:31,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:31,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:31,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:31,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:31,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:31,423 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-03 17:32:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:31,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:31,448 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:31,448 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:31,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:31,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:32,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:32,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 17:32:32,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:32,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 17:32:32,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 17:32:32,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:32:32,955 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 17:32:33,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:33,007 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 17:32:33,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:32:33,008 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 17:32:33,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:33,008 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:32:33,008 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 17:32:33,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:32:33,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 17:32:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 17:32:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:32:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 17:32:33,012 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 17:32:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:33,013 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 17:32:33,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 17:32:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 17:32:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:32:33,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:33,014 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 17:32:33,014 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:33,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:33,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2018-12-03 17:32:33,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:33,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:33,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:33,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:33,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:34,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:34,409 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:34,410 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:34,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:34,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:34,410 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-03 17:32:34,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:34,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:34,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:34,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:36,039 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:36,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:36,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 17:32:36,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:36,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:32:36,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:32:36,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:32:36,059 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 17:32:36,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:36,126 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 17:32:36,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 17:32:36,127 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 17:32:36,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:36,127 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:32:36,128 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:32:36,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:32:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:32:36,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 17:32:36,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 17:32:36,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 17:32:36,132 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 17:32:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:36,132 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 17:32:36,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:32:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 17:32:36,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 17:32:36,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:36,133 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 17:32:36,133 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:36,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2018-12-03 17:32:36,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:36,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:36,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:36,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:36,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:36,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:36,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:36,749 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:36,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:36,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:36,750 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-03 17:32:36,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:36,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:36,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:32:36,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:36,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:36,791 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:36,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:38,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:38,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 17:32:38,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:38,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:32:38,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:32:38,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:32:38,753 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 17:32:38,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:38,811 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 17:32:38,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:32:38,811 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 17:32:38,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:38,812 INFO L225 Difference]: With dead ends: 45 [2018-12-03 17:32:38,812 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:32:38,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:32:38,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:32:38,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:32:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:32:38,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 17:32:38,816 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 17:32:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:38,817 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 17:32:38,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:32:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 17:32:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:32:38,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:38,818 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 17:32:38,818 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:38,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2018-12-03 17:32:38,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:38,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:38,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:38,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:38,819 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:39,710 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:39,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:39,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:39,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:39,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:39,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:39,711 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-03 17:32:39,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:39,721 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:39,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:39,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:39,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:39,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:41,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:41,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 17:32:41,477 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:41,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:32:41,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:32:41,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:32:41,479 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 17:32:41,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:41,573 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 17:32:41,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:32:41,573 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 17:32:41,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:41,574 INFO L225 Difference]: With dead ends: 46 [2018-12-03 17:32:41,574 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 17:32:41,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 17:32:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 17:32:41,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 17:32:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 17:32:41,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 17:32:41,578 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 17:32:41,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:41,578 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 17:32:41,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:32:41,578 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 17:32:41,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 17:32:41,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:41,578 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 17:32:41,579 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:41,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:41,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2018-12-03 17:32:41,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:41,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:41,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:41,580 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:42,352 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:42,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:42,353 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:42,353 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:42,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:42,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:42,353 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-03 17:32:42,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:42,363 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:42,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:42,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:42,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:44,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:44,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 17:32:44,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:44,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 17:32:44,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 17:32:44,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:32:44,667 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 17:32:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:44,769 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 17:32:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:32:44,770 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 17:32:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:44,771 INFO L225 Difference]: With dead ends: 47 [2018-12-03 17:32:44,771 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:32:44,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:32:44,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:32:44,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:32:44,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:32:44,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 17:32:44,773 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 17:32:44,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:44,774 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 17:32:44,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 17:32:44,774 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 17:32:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:32:44,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:44,774 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 17:32:44,774 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:44,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:44,775 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2018-12-03 17:32:44,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:44,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:44,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:44,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:45,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:45,521 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:45,521 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:45,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:45,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:45,521 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-03 17:32:45,529 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:45,529 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:45,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:32:45,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:45,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:45,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:47,441 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:47,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:47,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 17:32:47,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:47,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:32:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:32:47,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:32:47,461 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 17:32:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:47,532 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 17:32:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 17:32:47,532 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 17:32:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:47,533 INFO L225 Difference]: With dead ends: 48 [2018-12-03 17:32:47,533 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 17:32:47,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 17:32:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 17:32:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 17:32:47,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 17:32:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 17:32:47,536 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 17:32:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:47,536 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 17:32:47,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:32:47,536 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 17:32:47,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 17:32:47,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:47,537 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 17:32:47,537 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:47,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:47,537 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2018-12-03 17:32:47,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:47,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:47,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:47,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:48,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:48,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:48,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:48,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:48,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:48,345 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-03 17:32:48,354 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:48,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:48,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:48,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:48,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:48,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:50,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:50,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 17:32:50,646 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:50,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 17:32:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 17:32:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:32:50,648 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 17:32:50,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:50,700 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 17:32:50,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:32:50,701 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 17:32:50,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:50,701 INFO L225 Difference]: With dead ends: 49 [2018-12-03 17:32:50,702 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 17:32:50,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:32:50,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 17:32:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 17:32:50,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 17:32:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 17:32:50,705 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 17:32:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:50,705 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 17:32:50,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 17:32:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 17:32:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 17:32:50,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:50,706 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 17:32:50,706 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:50,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2018-12-03 17:32:50,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:50,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:50,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:50,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:50,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:51,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:51,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:51,470 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:51,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:51,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:51,470 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-03 17:32:51,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:51,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:32:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:51,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:51,513 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:51,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:53,713 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:53,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:53,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 17:32:53,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:53,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:32:53,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:32:53,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:32:53,735 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 17:32:53,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:53,859 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 17:32:53,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:32:53,859 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 17:32:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:53,860 INFO L225 Difference]: With dead ends: 50 [2018-12-03 17:32:53,860 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 17:32:53,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:32:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 17:32:53,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 17:32:53,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 17:32:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 17:32:53,863 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 17:32:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:53,864 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 17:32:53,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:32:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 17:32:53,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 17:32:53,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:53,865 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 17:32:53,865 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:53,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:53,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2018-12-03 17:32:53,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:53,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:53,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:32:53,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:53,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:53,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:54,766 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:54,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:54,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:54,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:54,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:54,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:54,767 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-03 17:32:54,775 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:32:54,775 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:32:54,799 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 17:32:54,799 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:54,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:54,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:32:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:57,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:32:57,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 17:32:57,034 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:32:57,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:32:57,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:32:57,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:32:57,036 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 17:32:57,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:32:57,165 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 17:32:57,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:32:57,165 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 17:32:57,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:32:57,166 INFO L225 Difference]: With dead ends: 51 [2018-12-03 17:32:57,166 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 17:32:57,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:32:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 17:32:57,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 17:32:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:32:57,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 17:32:57,170 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 17:32:57,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:32:57,170 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 17:32:57,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:32:57,171 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 17:32:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:32:57,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:32:57,171 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 17:32:57,172 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:32:57,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:32:57,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2018-12-03 17:32:57,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:32:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:57,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:32:57,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:32:57,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:32:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:32:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:58,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:58,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:32:58,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:32:58,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:32:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:32:58,010 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-03 17:32:58,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:32:58,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:32:58,039 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:32:58,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:32:58,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:32:58,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:32:58,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:00,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:00,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 17:33:00,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:00,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:33:00,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:33:00,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:33:00,608 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 17:33:00,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:00,958 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 17:33:00,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 17:33:00,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 17:33:00,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:00,960 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:33:00,960 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:33:00,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 17:33:00,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:33:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 17:33:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 17:33:00,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 17:33:00,962 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 17:33:00,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:00,963 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 17:33:00,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:33:00,963 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 17:33:00,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 17:33:00,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:00,964 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 17:33:00,964 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:00,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:00,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2018-12-03 17:33:00,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:00,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:00,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:00,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:00,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:01,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:01,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:01,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:01,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:01,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:01,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 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-03 17:33:01,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:01,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:01,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:01,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:04,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:04,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 17:33:04,530 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:04,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 17:33:04,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 17:33:04,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:33:04,532 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 17:33:04,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:04,620 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 17:33:04,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:33:04,621 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 17:33:04,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:04,622 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:33:04,622 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:33:04,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:33:04,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:33:04,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:33:04,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:33:04,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 17:33:04,625 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 17:33:04,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:04,625 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 17:33:04,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 17:33:04,625 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 17:33:04,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:33:04,626 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:04,626 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 17:33:04,626 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:04,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:04,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2018-12-03 17:33:04,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:04,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:04,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:04,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:04,627 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:05,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:05,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:05,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:05,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:05,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:05,850 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-03 17:33:05,860 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:05,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:05,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 17:33:05,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:05,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:05,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:08,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:08,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 17:33:08,414 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:08,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:33:08,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:33:08,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:33:08,416 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 17:33:08,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:08,471 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 17:33:08,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:33:08,472 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 17:33:08,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:08,473 INFO L225 Difference]: With dead ends: 54 [2018-12-03 17:33:08,473 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 17:33:08,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 17:33:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 17:33:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 17:33:08,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 17:33:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 17:33:08,476 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 17:33:08,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:08,477 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 17:33:08,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:33:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 17:33:08,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 17:33:08,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:08,477 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 17:33:08,478 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:08,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:08,478 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2018-12-03 17:33:08,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:08,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:08,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:08,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:09,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:09,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:09,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:09,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:09,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:09,781 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-03 17:33:09,789 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:09,789 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:09,810 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:09,810 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:09,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:09,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:09,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:12,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 17:33:12,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:12,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 17:33:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 17:33:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:33:12,458 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 17:33:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:12,600 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 17:33:12,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:33:12,600 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 17:33:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:12,601 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:33:12,601 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:33:12,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:33:12,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:33:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:33:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:33:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 17:33:12,604 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 17:33:12,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:12,604 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 17:33:12,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 17:33:12,604 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 17:33:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:33:12,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:12,605 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 17:33:12,605 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:12,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2018-12-03 17:33:12,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:12,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:12,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:12,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:12,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:12,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:14,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:14,191 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:14,191 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:14,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:14,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:14,191 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-03 17:33:14,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:14,200 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:14,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:14,232 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:14,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:17,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:17,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:17,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 17:33:17,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:17,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:33:17,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:33:17,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:33:17,241 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 17:33:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:17,303 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 17:33:17,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 17:33:17,303 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 17:33:17,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:17,304 INFO L225 Difference]: With dead ends: 56 [2018-12-03 17:33:17,304 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 17:33:17,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:33:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 17:33:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 17:33:17,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 17:33:17,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 17:33:17,308 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 17:33:17,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:17,308 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 17:33:17,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:33:17,308 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 17:33:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 17:33:17,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:17,308 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 17:33:17,309 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:17,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2018-12-03 17:33:17,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:17,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:17,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:18,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:18,818 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:18,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:18,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:18,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:18,819 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-03 17:33:18,828 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:18,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:18,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:33:18,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:18,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:18,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:21,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:21,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 17:33:21,967 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:21,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:33:21,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:33:21,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:33:21,969 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 17:33:22,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:22,126 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 17:33:22,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:33:22,126 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 17:33:22,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:22,127 INFO L225 Difference]: With dead ends: 57 [2018-12-03 17:33:22,127 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 17:33:22,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:33:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 17:33:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 17:33:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 17:33:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 17:33:22,130 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 17:33:22,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:22,130 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 17:33:22,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:33:22,130 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 17:33:22,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 17:33:22,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:22,131 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 17:33:22,131 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:22,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:22,131 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2018-12-03 17:33:22,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:22,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:22,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:22,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:22,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:23,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:23,225 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:23,225 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:23,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:23,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:23,225 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-03 17:33:23,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:23,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:23,257 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:23,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:23,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:23,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:26,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:26,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 17:33:26,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:26,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:33:26,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:33:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:33:26,442 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 17:33:26,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:26,534 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 17:33:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:33:26,535 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 17:33:26,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:26,535 INFO L225 Difference]: With dead ends: 58 [2018-12-03 17:33:26,535 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 17:33:26,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 17:33:26,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 17:33:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 17:33:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 17:33:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 17:33:26,538 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 17:33:26,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:26,539 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 17:33:26,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:33:26,539 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 17:33:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 17:33:26,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:26,539 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 17:33:26,540 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2018-12-03 17:33:26,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:26,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:26,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:26,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:27,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:27,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:27,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:27,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:27,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:27,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:27,602 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-03 17:33:27,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:27,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:27,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:27,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:30,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:30,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:30,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 17:33:30,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:30,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 17:33:30,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 17:33:30,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:33:30,930 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 17:33:31,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:31,021 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 17:33:31,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:33:31,022 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 17:33:31,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:31,023 INFO L225 Difference]: With dead ends: 59 [2018-12-03 17:33:31,023 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 17:33:31,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:33:31,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 17:33:31,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 17:33:31,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:33:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 17:33:31,025 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 17:33:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:31,026 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 17:33:31,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 17:33:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 17:33:31,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:33:31,026 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:31,027 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 17:33:31,027 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:31,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:31,027 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2018-12-03 17:33:31,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:31,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:31,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:31,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:32,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:32,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:32,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:32,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:32,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:32,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:32,170 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-03 17:33:32,178 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:32,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:32,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:33:32,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:32,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:32,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:32,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:35,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:35,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 17:33:35,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:35,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:33:35,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:33:35,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:33:35,500 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 17:33:35,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:35,568 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 17:33:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 17:33:35,568 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 17:33:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:35,569 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:33:35,570 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:33:35,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 17:33:35,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:33:35,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 17:33:35,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 17:33:35,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 17:33:35,572 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 17:33:35,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:35,572 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 17:33:35,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:33:35,573 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 17:33:35,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 17:33:35,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:35,573 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 17:33:35,573 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:35,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:35,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2018-12-03 17:33:35,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:35,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:35,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:35,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:36,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:36,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:36,772 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:36,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:36,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:36,772 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-03 17:33:36,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:36,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:36,804 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:36,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:36,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:36,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:36,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:40,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:40,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 17:33:40,274 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:40,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 17:33:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 17:33:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:33:40,276 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 17:33:40,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:40,365 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 17:33:40,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:33:40,366 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 17:33:40,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:40,366 INFO L225 Difference]: With dead ends: 61 [2018-12-03 17:33:40,366 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:33:40,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:33:40,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:33:40,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:33:40,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:33:40,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 17:33:40,369 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 17:33:40,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:40,369 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 17:33:40,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 17:33:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 17:33:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:33:40,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:40,370 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 17:33:40,370 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:40,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:40,370 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2018-12-03 17:33:40,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:40,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:40,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:40,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:41,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:41,814 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:41,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:41,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:41,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:41,814 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-03 17:33:41,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:41,833 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:41,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:41,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:41,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:45,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:45,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:45,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 17:33:45,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:45,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:33:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:33:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:33:45,534 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 17:33:45,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:45,644 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 17:33:45,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:33:45,644 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 17:33:45,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:45,645 INFO L225 Difference]: With dead ends: 62 [2018-12-03 17:33:45,645 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 17:33:45,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:33:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 17:33:45,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 17:33:45,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 17:33:45,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 17:33:45,648 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 17:33:45,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:45,648 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 17:33:45,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:33:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 17:33:45,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 17:33:45,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:45,649 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 17:33:45,649 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:45,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2018-12-03 17:33:45,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:45,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:45,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:45,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:45,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:46,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:46,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:46,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:46,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:46,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:46,929 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-03 17:33:46,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:33:46,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:33:46,980 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 17:33:46,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:46,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:46,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:50,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 17:33:50,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:50,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:33:50,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:33:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:33:50,601 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 17:33:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:50,673 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 17:33:50,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:33:50,673 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 17:33:50,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:50,674 INFO L225 Difference]: With dead ends: 63 [2018-12-03 17:33:50,674 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:33:50,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:33:50,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:33:50,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:33:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:33:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 17:33:50,679 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 17:33:50,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:50,679 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 17:33:50,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:33:50,679 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 17:33:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:33:50,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:50,679 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 17:33:50,680 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:50,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2018-12-03 17:33:50,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:50,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:50,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:50,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:50,681 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:50,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:52,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:52,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:52,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:52,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:52,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:52,279 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-03 17:33:52,287 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:33:52,287 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:33:52,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:33:52,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:33:52,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:52,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:33:56,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:56,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:33:56,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 17:33:56,164 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:33:56,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:33:56,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:33:56,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:33:56,166 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 17:33:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:33:56,276 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 17:33:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 17:33:56,276 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 17:33:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:33:56,277 INFO L225 Difference]: With dead ends: 64 [2018-12-03 17:33:56,277 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 17:33:56,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 17:33:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 17:33:56,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 17:33:56,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 17:33:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 17:33:56,280 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 17:33:56,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:33:56,280 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 17:33:56,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:33:56,281 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 17:33:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 17:33:56,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:33:56,281 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 17:33:56,281 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:33:56,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:33:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2018-12-03 17:33:56,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:33:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:56,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:33:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:33:56,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:33:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:57,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:57,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:57,690 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:33:57,690 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:33:57,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:33:57,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:33:57,690 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-03 17:33:57,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:33:57,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:33:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:33:57,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:33:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:33:57,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:01,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:01,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 17:34:01,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:01,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 17:34:01,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 17:34:01,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:34:01,903 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 17:34:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:01,991 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 17:34:01,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:34:01,991 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 17:34:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:01,992 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:34:01,992 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 17:34:01,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:34:01,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 17:34:01,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 17:34:01,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 17:34:01,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 17:34:01,996 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 17:34:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:01,997 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 17:34:01,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 17:34:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 17:34:01,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 17:34:01,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:01,997 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 17:34:01,997 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:01,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2018-12-03 17:34:01,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:01,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:01,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:01,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:03,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:03,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:03,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:03,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:03,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:03,442 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-03 17:34:03,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:03,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:03,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 17:34:03,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:03,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:03,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:07,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:07,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:07,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 17:34:07,692 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:07,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:34:07,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:34:07,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:34:07,694 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 17:34:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:07,766 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 17:34:07,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:34:07,766 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 17:34:07,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:07,767 INFO L225 Difference]: With dead ends: 66 [2018-12-03 17:34:07,767 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 17:34:07,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 17:34:07,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 17:34:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 17:34:07,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 17:34:07,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 17:34:07,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 17:34:07,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:07,770 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 17:34:07,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:34:07,770 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 17:34:07,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 17:34:07,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:07,770 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 17:34:07,771 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:07,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:07,771 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2018-12-03 17:34:07,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:07,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:07,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:07,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:07,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:09,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:09,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:09,223 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:09,223 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:09,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:09,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:09,223 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-03 17:34:09,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:09,232 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:09,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:09,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:09,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:09,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:13,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:13,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 17:34:13,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:13,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 17:34:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 17:34:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:34:13,464 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 17:34:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:13,581 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 17:34:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:34:13,582 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 17:34:13,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:13,582 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:34:13,582 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 17:34:13,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:34:13,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 17:34:13,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 17:34:13,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:34:13,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 17:34:13,584 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 17:34:13,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:13,585 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 17:34:13,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 17:34:13,585 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 17:34:13,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:34:13,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:13,585 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 17:34:13,585 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:13,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:13,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2018-12-03 17:34:13,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:13,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:13,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:14,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:14,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:14,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:14,987 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:14,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:14,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:14,987 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-03 17:34:14,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:14,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:15,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:15,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:19,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:19,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 17:34:19,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:19,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:34:19,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:34:19,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:34:19,288 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 17:34:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:19,415 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 17:34:19,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 17:34:19,415 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 17:34:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:19,416 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:34:19,416 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:34:19,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:34:19,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:34:19,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 17:34:19,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 17:34:19,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 17:34:19,418 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 17:34:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:19,419 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 17:34:19,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:34:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 17:34:19,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 17:34:19,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:19,419 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 17:34:19,420 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:19,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:19,420 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2018-12-03 17:34:19,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:19,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:19,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:19,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:19,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:19,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:21,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:21,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:21,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:21,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:21,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:21,203 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-03 17:34:21,211 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:21,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:21,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:34:21,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:21,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:21,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:25,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:25,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 17:34:25,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:25,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:34:25,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:34:25,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:34:25,351 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 17:34:25,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:25,461 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 17:34:25,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:34:25,461 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 17:34:25,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:25,462 INFO L225 Difference]: With dead ends: 69 [2018-12-03 17:34:25,462 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:34:25,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:34:25,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:34:25,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:34:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:34:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 17:34:25,467 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 17:34:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:25,467 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 17:34:25,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:34:25,467 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 17:34:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:34:25,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:25,468 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 17:34:25,468 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:25,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2018-12-03 17:34:25,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:25,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:25,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:25,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:27,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:27,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:27,158 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:27,158 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:27,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:27,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:27,158 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-03 17:34:27,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:27,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:27,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:27,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:27,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:27,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:31,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:31,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:31,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 17:34:31,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:31,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:34:31,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:34:31,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:34:31,844 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 17:34:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:31,961 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 17:34:31,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:34:31,962 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 17:34:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:31,963 INFO L225 Difference]: With dead ends: 70 [2018-12-03 17:34:31,963 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 17:34:31,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 17:34:31,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 17:34:31,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 17:34:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 17:34:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 17:34:31,967 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 17:34:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:31,967 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 17:34:31,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:34:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 17:34:31,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 17:34:31,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:31,968 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 17:34:31,968 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:31,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:31,968 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2018-12-03 17:34:31,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:31,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:31,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:31,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:33,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:33,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:33,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:33,506 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:33,506 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:33,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:33,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 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-03 17:34:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:33,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:33,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:33,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:33,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:38,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:38,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:38,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 17:34:38,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:38,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 17:34:38,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 17:34:38,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:34:38,297 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 17:34:38,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:38,385 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 17:34:38,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:34:38,386 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 17:34:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:38,386 INFO L225 Difference]: With dead ends: 71 [2018-12-03 17:34:38,386 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:34:38,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:34:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:34:38,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:34:38,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:34:38,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 17:34:38,390 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 17:34:38,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:38,390 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 17:34:38,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 17:34:38,390 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 17:34:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:34:38,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:38,391 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 17:34:38,391 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:38,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:38,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2018-12-03 17:34:38,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:38,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:38,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:38,392 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:40,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:40,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:40,676 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:40,676 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:40,676 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:40,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:40,677 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-03 17:34:40,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:34:40,685 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:34:40,725 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:34:40,725 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:40,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:40,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:45,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:45,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:45,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 17:34:45,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:45,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:34:45,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:34:45,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:34:45,608 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 17:34:45,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:45,705 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 17:34:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 17:34:45,706 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 17:34:45,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:45,706 INFO L225 Difference]: With dead ends: 72 [2018-12-03 17:34:45,706 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 17:34:45,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 17:34:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 17:34:45,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 17:34:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 17:34:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 17:34:45,710 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 17:34:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:45,710 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 17:34:45,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:34:45,710 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 17:34:45,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 17:34:45,711 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:45,711 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 17:34:45,711 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:45,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2018-12-03 17:34:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:45,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:45,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:45,712 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:47,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:47,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:47,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:47,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:47,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:47,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:47,641 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-03 17:34:47,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:34:47,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:34:47,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:34:47,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:34:47,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:47,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:34:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:52,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:34:52,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 17:34:52,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:34:52,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 17:34:52,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 17:34:52,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:34:52,681 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 17:34:52,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:34:52,976 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 17:34:52,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:34:52,977 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 17:34:52,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:34:52,977 INFO L225 Difference]: With dead ends: 73 [2018-12-03 17:34:52,977 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 17:34:52,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 17:34:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 17:34:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 17:34:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 17:34:52,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 17:34:52,980 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 17:34:52,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:34:52,980 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 17:34:52,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 17:34:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 17:34:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 17:34:52,981 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:34:52,981 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 17:34:52,981 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:34:52,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:34:52,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2018-12-03 17:34:52,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:34:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:52,982 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:34:52,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:34:52,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:34:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:55,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:55,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:34:55,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:34:55,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:34:55,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:34:55,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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:34:55,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:34:55,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:34:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:34:55,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:34:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:34:55,132 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:00,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:00,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 17:35:00,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:00,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 17:35:00,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 17:35:00,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:35:00,241 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 17:35:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:00,331 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 17:35:00,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:35:00,332 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 17:35:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:00,333 INFO L225 Difference]: With dead ends: 74 [2018-12-03 17:35:00,333 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 17:35:00,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:35:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 17:35:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 17:35:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 17:35:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 17:35:00,336 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 17:35:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:00,336 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 17:35:00,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 17:35:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 17:35:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 17:35:00,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:00,337 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 17:35:00,337 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:00,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:00,337 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2018-12-03 17:35:00,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:00,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:00,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:00,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:02,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:02,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:02,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:02,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:02,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:02,347 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:02,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:02,356 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:02,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 17:35:02,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:02,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:02,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:07,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:07,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:07,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 17:35:07,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:07,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:35:07,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:35:07,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:35:07,722 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 17:35:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:07,934 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 17:35:07,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:35:07,935 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 17:35:07,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:07,935 INFO L225 Difference]: With dead ends: 75 [2018-12-03 17:35:07,935 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 17:35:07,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 17:35:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 17:35:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 17:35:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:35:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 17:35:07,938 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 17:35:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:07,938 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 17:35:07,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:35:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 17:35:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:35:07,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:07,939 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 17:35:07,939 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:07,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:07,939 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2018-12-03 17:35:07,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:07,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:07,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:07,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:09,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:09,755 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:09,755 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:09,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:09,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:09,755 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:09,763 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:09,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:09,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:09,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:09,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:09,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:09,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:15,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:15,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 17:35:15,343 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:15,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:35:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:35:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:35:15,344 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 17:35:15,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:15,514 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 17:35:15,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 17:35:15,515 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 17:35:15,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:15,516 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:35:15,516 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:35:15,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:35:15,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:35:15,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 17:35:15,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 17:35:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 17:35:15,520 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 17:35:15,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:15,520 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 17:35:15,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:35:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 17:35:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 17:35:15,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:15,521 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 17:35:15,521 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:15,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:15,521 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2018-12-03 17:35:15,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:15,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:15,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:15,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:15,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:17,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:17,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:17,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:17,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:17,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:17,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:17,576 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:17,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:17,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:17,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:17,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:23,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:23,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:23,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 17:35:23,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:23,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:35:23,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:35:23,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:35:23,247 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 17:35:23,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:23,449 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 17:35:23,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:35:23,449 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 17:35:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:23,450 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:35:23,450 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:35:23,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:35:23,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:35:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:35:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:35:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 17:35:23,454 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 17:35:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:23,454 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 17:35:23,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:35:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 17:35:23,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:35:23,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:23,455 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 17:35:23,456 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:23,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:23,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2018-12-03 17:35:23,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:23,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:23,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:23,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:23,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:25,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:25,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:25,346 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:25,346 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:25,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:25,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:25,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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:25,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:25,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:25,401 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 17:35:25,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:25,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:25,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:25,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:31,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:31,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 17:35:31,129 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:31,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 17:35:31,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 17:35:31,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:35:31,131 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 17:35:31,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:31,274 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 17:35:31,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:35:31,274 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 17:35:31,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:31,275 INFO L225 Difference]: With dead ends: 78 [2018-12-03 17:35:31,275 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 17:35:31,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:35:31,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 17:35:31,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 17:35:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 17:35:31,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 17:35:31,279 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 17:35:31,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:31,279 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 17:35:31,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 17:35:31,280 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 17:35:31,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 17:35:31,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:31,280 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 17:35:31,281 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:31,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:31,281 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2018-12-03 17:35:31,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:31,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:31,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:31,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:31,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:33,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:33,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:33,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:33,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:33,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:33,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:33,452 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:33,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:35:33,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:35:33,492 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:35:33,492 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:33,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:33,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:33,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:39,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:39,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 17:35:39,329 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:39,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:35:39,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:35:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:35:39,331 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 17:35:39,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:39,477 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 17:35:39,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:35:39,477 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 17:35:39,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:39,478 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:35:39,478 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:35:39,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 17:35:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:35:39,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:35:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:35:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 17:35:39,482 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 17:35:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:39,482 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 17:35:39,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:35:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 17:35:39,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:35:39,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:39,483 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 17:35:39,483 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:39,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2018-12-03 17:35:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:39,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:39,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:39,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:39,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:42,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:42,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:42,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:42,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:42,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:42,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:42,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:42,451 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:35:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:42,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:42,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:42,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:48,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 17:35:48,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:48,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 17:35:48,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 17:35:48,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:35:48,753 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 17:35:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:48,914 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 17:35:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 17:35:48,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 17:35:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:48,915 INFO L225 Difference]: With dead ends: 80 [2018-12-03 17:35:48,915 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 17:35:48,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:35:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 17:35:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 17:35:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 17:35:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 17:35:48,918 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 17:35:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:48,918 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 17:35:48,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 17:35:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 17:35:48,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 17:35:48,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:48,918 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 17:35:48,919 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:48,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2018-12-03 17:35:48,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:48,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:48,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:35:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:48,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:35:50,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:50,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:50,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:35:50,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:35:50,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:35:50,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:35:50,960 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:35:50,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:35:50,968 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:35:51,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:35:51,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:35:51,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:35:51,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:51,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:35:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:35:57,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:35:57,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 17:35:57,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:35:57,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:35:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:35:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:35:57,301 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 17:35:57,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:35:57,408 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 17:35:57,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:35:57,409 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 17:35:57,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:35:57,409 INFO L225 Difference]: With dead ends: 81 [2018-12-03 17:35:57,410 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 17:35:57,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 17:35:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 17:35:57,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 17:35:57,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 17:35:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 17:35:57,414 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 17:35:57,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:35:57,414 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 17:35:57,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:35:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 17:35:57,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 17:35:57,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:35:57,415 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 17:35:57,415 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:35:57,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:35:57,415 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2018-12-03 17:35:57,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:35:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:57,416 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:35:57,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:35:57,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:35:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:00,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:00,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:00,523 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:00,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:00,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:00,523 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:00,532 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:00,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:00,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:00,565 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:00,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:00,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:06,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:06,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:06,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:36:06,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:06,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:36:06,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:36:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:36:06,926 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 17:36:07,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:07,039 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 17:36:07,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:36:07,039 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 17:36:07,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:07,040 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:36:07,040 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:36:07,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:36:07,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:36:07,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:36:07,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:36:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 17:36:07,043 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 17:36:07,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:07,044 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 17:36:07,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:36:07,044 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 17:36:07,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:36:07,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:07,044 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 17:36:07,044 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:07,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:07,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2018-12-03 17:36:07,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:07,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:07,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:07,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:07,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:09,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:09,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:09,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:09,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:09,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:09,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:09,618 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:09,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:09,627 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:09,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:09,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:09,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:16,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:16,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:36:16,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:16,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:36:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:36:16,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:36:16,200 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 17:36:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:16,574 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 17:36:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:36:16,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 17:36:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:16,575 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:36:16,575 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:36:16,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:36:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:36:16,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:36:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:36:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 17:36:16,578 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 17:36:16,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:16,579 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 17:36:16,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:36:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 17:36:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:36:16,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:16,580 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 17:36:16,580 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:16,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:16,580 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2018-12-03 17:36:16,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:16,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:16,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:16,581 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:16,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:19,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:19,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:19,414 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:19,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:19,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:19,414 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:19,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:19,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:19,537 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:36:19,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:19,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:19,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:26,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:26,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:36:26,398 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:26,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:36:26,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:36:26,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:36:26,399 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 17:36:27,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:27,000 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 17:36:27,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:36:27,001 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 17:36:27,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:27,002 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:36:27,002 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:36:27,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:36:27,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:36:27,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:36:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:36:27,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 17:36:27,006 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 17:36:27,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:27,006 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 17:36:27,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:36:27,007 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 17:36:27,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:36:27,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:27,007 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 17:36:27,007 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:27,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:27,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2018-12-03 17:36:27,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:27,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:27,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:27,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:27,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:31,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:31,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:31,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:31,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:31,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:31,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:31,158 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:31,166 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:36:31,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:36:31,200 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:36:31,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:31,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:31,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:38,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:36:38,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:38,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:36:38,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:36:38,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:36:38,181 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 17:36:38,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:38,331 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 17:36:38,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:36:38,331 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 17:36:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:38,331 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:36:38,332 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:36:38,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:36:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:36:38,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:36:38,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:36:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 17:36:38,336 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 17:36:38,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:38,336 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 17:36:38,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:36:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 17:36:38,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:36:38,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:38,337 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 17:36:38,337 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:38,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:38,337 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2018-12-03 17:36:38,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:38,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:38,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:38,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:38,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:38,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:41,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:41,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:41,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:41,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:41,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:41,213 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:41,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:41,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:36:41,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:41,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:41,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:48,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:48,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:36:48,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:48,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:36:48,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:36:48,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:36:48,379 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 17:36:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:48,507 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 17:36:48,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:36:48,507 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 17:36:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:48,508 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:36:48,508 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:36:48,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:36:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:36:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:36:48,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:36:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 17:36:48,513 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 17:36:48,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:48,513 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 17:36:48,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:36:48,513 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 17:36:48,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:36:48,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:48,514 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 17:36:48,514 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:48,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:48,514 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2018-12-03 17:36:48,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:48,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:36:48,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:48,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:36:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:51,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:51,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:36:51,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:36:51,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:36:51,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:36:51,196 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:36:51,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:36:51,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:36:51,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 17:36:51,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:36:51,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:36:51,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:51,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:36:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:36:58,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:36:58,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:36:58,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:36:58,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:36:58,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:36:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:36:58,842 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 17:36:59,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:36:59,016 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 17:36:59,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:36:59,016 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 17:36:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:36:59,016 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:36:59,016 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:36:59,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:36:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:36:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:36:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:36:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 17:36:59,019 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 17:36:59,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:36:59,019 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 17:36:59,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:36:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 17:36:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:36:59,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:36:59,020 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 17:36:59,020 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:36:59,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:36:59,020 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2018-12-03 17:36:59,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:36:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:59,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:36:59,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:36:59,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:36:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:01,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:01,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:01,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:01,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:01,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:01,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:01,918 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:01,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:01,927 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:01,957 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:01,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:01,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:01,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:09,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:09,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:09,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:37:09,390 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:09,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:37:09,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:37:09,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:37:09,391 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 17:37:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:09,559 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 17:37:09,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:37:09,559 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 17:37:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:09,559 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:37:09,559 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:37:09,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:37:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:37:09,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:37:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:37:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 17:37:09,562 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 17:37:09,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:09,562 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 17:37:09,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:37:09,562 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 17:37:09,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:37:09,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:09,563 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 17:37:09,563 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:09,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:09,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2018-12-03 17:37:09,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:09,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:09,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:09,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:12,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:12,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:12,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:12,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:12,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:12,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:12,297 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:12,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:12,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:12,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:12,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:21,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:21,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:37:21,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:21,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:37:21,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:37:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:37:21,367 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 17:37:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:21,601 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 17:37:21,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:37:21,601 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 17:37:21,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:21,602 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:37:21,602 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:37:21,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:37:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:37:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:37:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:37:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 17:37:21,605 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 17:37:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:21,605 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 17:37:21,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:37:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 17:37:21,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:37:21,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:21,605 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 17:37:21,606 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:21,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:21,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2018-12-03 17:37:21,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:21,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:21,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:21,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:21,607 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:24,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:24,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:24,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:24,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:24,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:24,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:24,167 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:24,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:24,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:24,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 17:37:24,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:24,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:24,249 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:32,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:32,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:32,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:37:32,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:32,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:37:32,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:37:32,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:37:32,314 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 17:37:32,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:32,455 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 17:37:32,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:37:32,456 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 17:37:32,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:32,456 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:37:32,456 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:37:32,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:37:32,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:37:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:37:32,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:37:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 17:37:32,460 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 17:37:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:32,460 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 17:37:32,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:37:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 17:37:32,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:37:32,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:32,460 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 17:37:32,461 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:32,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2018-12-03 17:37:32,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:32,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:32,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:32,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:35,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:35,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:35,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:35,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:35,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:35,044 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:35,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:37:35,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:37:35,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:37:35,086 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:35,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:35,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:43,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:43,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:37:43,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:43,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:37:43,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:37:43,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:37:43,168 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 17:37:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:43,319 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 17:37:43,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:37:43,319 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 17:37:43,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:43,320 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:37:43,320 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:37:43,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:37:43,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:37:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:37:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:37:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 17:37:43,323 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 17:37:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:43,323 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 17:37:43,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:37:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 17:37:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:37:43,324 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:43,324 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 17:37:43,324 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:43,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2018-12-03 17:37:43,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:43,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:43,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:37:43,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:43,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:46,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:46,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:46,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:46,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:46,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:46,145 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:46,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:46,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:37:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:46,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:46,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:46,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:37:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:54,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:37:54,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:37:54,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:37:54,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:37:54,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:37:54,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:37:54,355 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 17:37:54,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:37:54,711 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 17:37:54,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:37:54,712 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 17:37:54,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:37:54,712 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:37:54,713 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:37:54,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:37:54,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:37:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:37:54,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:37:54,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 17:37:54,716 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 17:37:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:37:54,716 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 17:37:54,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:37:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 17:37:54,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:37:54,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:37:54,717 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 17:37:54,717 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:37:54,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:37:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2018-12-03 17:37:54,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:37:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:37:54,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:37:54,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:37:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:37:57,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:57,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:57,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:37:57,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:37:57,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:37:57,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:37:57,832 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:37:57,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:37:57,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:37:57,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:37:57,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:37:57,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:37:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:37:57,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:06,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:06,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:06,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:38:06,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:06,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:38:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:38:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:38:06,198 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 17:38:06,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:06,522 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 17:38:06,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:38:06,522 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 17:38:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:06,523 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:38:06,523 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:38:06,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:38:06,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:38:06,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:38:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:38:06,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 17:38:06,526 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 17:38:06,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:06,527 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 17:38:06,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:38:06,527 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 17:38:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:38:06,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:06,528 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 17:38:06,528 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:06,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:06,528 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2018-12-03 17:38:06,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:06,529 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:06,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:06,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:09,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:09,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:09,337 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:09,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:09,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:09,337 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:09,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:09,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:09,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:09,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:09,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:18,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:18,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:38:18,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:18,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:38:18,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:38:18,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:38:18,095 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 17:38:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:18,228 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 17:38:18,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:38:18,229 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 17:38:18,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:18,230 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:38:18,230 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:38:18,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:38:18,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:38:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:38:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:38:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 17:38:18,233 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 17:38:18,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:18,233 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 17:38:18,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:38:18,234 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 17:38:18,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:38:18,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:18,234 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 17:38:18,234 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:18,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:18,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2018-12-03 17:38:18,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:18,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:18,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:18,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:18,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:21,040 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:21,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:21,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:21,040 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:21,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:21,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:21,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:21,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:21,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:21,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:21,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:30,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:30,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:30,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:38:30,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:30,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:38:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:38:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:38:30,060 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 17:38:30,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:30,284 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 17:38:30,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:38:30,284 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 17:38:30,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:30,285 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:38:30,285 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:38:30,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:38:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:38:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:38:30,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:38:30,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 17:38:30,288 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 17:38:30,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:30,288 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 17:38:30,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:38:30,289 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 17:38:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:38:30,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:30,289 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 17:38:30,290 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:30,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2018-12-03 17:38:30,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:30,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:30,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:30,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:30,291 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:33,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:33,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:33,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:33,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:33,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:33,488 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:33,496 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:38:33,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:38:33,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:38:33,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:33,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:33,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:42,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:42,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:42,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:38:42,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:42,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:38:42,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:38:42,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:38:42,908 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 17:38:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:43,039 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 17:38:43,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:38:43,040 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 17:38:43,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:43,040 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:38:43,041 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:38:43,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:38:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:38:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:38:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:38:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 17:38:43,044 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 17:38:43,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:43,045 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 17:38:43,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:38:43,045 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 17:38:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:38:43,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:43,046 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 17:38:43,046 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:43,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2018-12-03 17:38:43,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:43,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:43,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:43,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:43,047 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:46,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:46,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:46,034 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:46,035 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:46,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:46,035 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:46,044 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:38:46,044 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:38:46,082 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:38:46,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:38:46,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:46,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:38:55,221 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:55,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:38:55,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:38:55,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:38:55,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:38:55,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:38:55,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:38:55,241 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 17:38:55,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:38:55,478 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 17:38:55,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:38:55,478 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 17:38:55,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:38:55,479 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:38:55,479 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:38:55,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:38:55,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:38:55,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:38:55,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:38:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 17:38:55,483 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 17:38:55,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:38:55,483 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 17:38:55,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:38:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 17:38:55,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:38:55,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:38:55,484 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 17:38:55,484 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:38:55,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:38:55,484 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2018-12-03 17:38:55,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:38:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:55,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:38:55,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:38:55,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:38:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:58,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:58,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:38:58,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:38:58,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:38:58,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:38:58,936 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:38:58,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:38:58,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:38:58,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:38:58,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:38:59,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:38:59,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:08,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:08,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:08,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:39:08,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:08,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:39:08,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:39:08,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:39:08,893 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 17:39:09,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:09,073 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 17:39:09,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:39:09,073 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 17:39:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:09,073 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:39:09,074 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:39:09,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:39:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:39:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:39:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:39:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 17:39:09,076 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 17:39:09,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:09,077 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 17:39:09,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:39:09,077 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 17:39:09,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:39:09,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:09,077 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 17:39:09,077 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:09,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:09,078 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2018-12-03 17:39:09,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:09,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:09,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:09,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:12,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:12,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:12,199 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:12,199 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:12,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:12,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:12,200 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:12,207 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:39:12,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:39:12,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 17:39:12,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:12,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:12,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:12,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:21,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:21,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:21,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:39:21,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:21,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:39:21,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:39:21,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:39:21,955 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 17:39:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:22,105 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 17:39:22,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:39:22,105 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 17:39:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:22,106 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:39:22,106 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:39:22,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:39:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:39:22,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:39:22,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:39:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 17:39:22,110 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 17:39:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:22,110 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 17:39:22,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:39:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 17:39:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:39:22,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:22,110 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 17:39:22,111 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:22,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2018-12-03 17:39:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:22,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:22,111 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:22,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:25,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:25,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:25,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:25,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:25,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:25,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:25,546 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:25,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:39:25,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:39:25,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:39:25,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:25,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:25,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:35,477 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:35,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:35,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:39:35,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:35,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:39:35,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:39:35,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:39:35,498 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 17:39:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:35,657 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 17:39:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:39:35,657 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 17:39:35,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:35,658 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:39:35,658 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:39:35,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:39:35,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:39:35,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:39:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:39:35,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 17:39:35,662 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 17:39:35,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:35,662 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 17:39:35,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:39:35,662 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 17:39:35,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:39:35,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:35,663 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 17:39:35,663 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:35,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:35,663 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2018-12-03 17:39:35,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:35,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:35,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:39:35,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:35,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:39,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:39,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:39,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:39,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:39,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:39,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:39,143 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:39,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:39,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:39:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:39,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:39,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:39,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:39:49,173 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:49,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:39:49,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:39:49,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:39:49,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:39:49,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:39:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:39:49,194 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 17:39:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:39:49,346 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 17:39:49,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:39:49,347 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 17:39:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:39:49,347 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:39:49,348 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:39:49,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:39:49,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:39:49,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:39:49,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:39:49,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 17:39:49,352 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 17:39:49,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:39:49,352 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 17:39:49,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:39:49,352 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 17:39:49,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:39:49,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:39:49,353 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 17:39:49,353 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:39:49,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:39:49,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2018-12-03 17:39:49,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:39:49,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:39:49,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:39:49,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:39:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:39:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:52,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:39:52,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:39:52,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:39:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:39:52,623 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:39:52,633 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:39:52,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:39:52,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 17:39:52,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:39:52,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:39:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:39:52,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:03,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:03,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:40:03,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:03,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:40:03,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:40:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:40:03,051 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 17:40:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:03,226 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 17:40:03,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:40:03,227 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 17:40:03,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:03,227 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:40:03,227 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:40:03,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:40:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:40:03,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:40:03,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:40:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 17:40:03,230 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 17:40:03,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:03,231 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 17:40:03,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:40:03,231 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 17:40:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:40:03,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:03,232 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 17:40:03,232 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:03,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:03,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2018-12-03 17:40:03,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:03,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:03,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:03,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:06,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:06,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:06,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:06,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:06,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:06,751 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:06,760 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:06,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:06,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:06,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:06,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:06,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:17,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:17,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:17,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:40:17,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:17,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:40:17,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:40:17,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:40:17,306 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 17:40:17,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:17,509 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 17:40:17,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:40:17,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 17:40:17,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:17,510 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:40:17,510 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:40:17,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:40:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:40:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:40:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:40:17,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 17:40:17,514 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 17:40:17,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:17,514 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 17:40:17,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:40:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 17:40:17,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:40:17,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:17,515 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 17:40:17,515 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:17,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:17,516 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2018-12-03 17:40:17,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:17,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:17,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:17,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:17,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:21,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:21,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:21,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:21,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:21,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:21,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:21,167 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:21,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:21,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:21,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:21,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:21,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:31,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:40:31,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:31,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:40:31,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:40:31,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:40:31,748 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 17:40:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:32,047 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 17:40:32,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:40:32,047 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 17:40:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:32,048 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:40:32,048 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:40:32,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:40:32,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:40:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:40:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:40:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 17:40:32,051 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 17:40:32,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:32,052 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 17:40:32,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:40:32,052 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 17:40:32,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:40:32,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:32,052 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 17:40:32,053 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:32,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:32,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2018-12-03 17:40:32,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:32,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:32,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:32,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:35,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:35,748 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:35,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40: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-03 17:40:35,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40: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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:35,757 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:35,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:35,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:40:35,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:35,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:35,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:46,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:46,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:46,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:40:46,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:46,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:40:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:40:46,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:40:46,771 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 17:40:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:47,013 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 17:40:47,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:40:47,013 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 17:40:47,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:47,014 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:40:47,014 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:40:47,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:40:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:40:47,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:40:47,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:40:47,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 17:40:47,018 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 17:40:47,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:47,018 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 17:40:47,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:40:47,018 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 17:40:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:40:47,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:47,019 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 17:40:47,019 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:47,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2018-12-03 17:40:47,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:47,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:47,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:47,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:47,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:50,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:50,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:50,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:50,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:50,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:50,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:50,811 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:40:50,819 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:50,819 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:50,860 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:50,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:50,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:50,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:01,847 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:01,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:01,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:41:01,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:01,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:41:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:41:01,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:41:01,869 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 17:41:02,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:02,143 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 17:41:02,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:41:02,143 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 17:41:02,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:02,143 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:41:02,144 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:41:02,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:41:02,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:41:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:41:02,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:41:02,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 17:41:02,148 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 17:41:02,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:02,148 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 17:41:02,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:41:02,148 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 17:41:02,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:41:02,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:02,149 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 17:41:02,149 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:02,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:02,149 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2018-12-03 17:41:02,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:02,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:02,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:02,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:05,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:05,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:05,957 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:05,957 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:05,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:05,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:05,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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:41:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:05,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:06,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:06,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:17,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:17,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:41:17,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:41:17,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:41:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:41:17,042 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 17:41:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:17,220 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 17:41:17,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:41:17,220 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 17:41:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:17,221 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:41:17,221 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:41:17,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:41:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:41:17,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:41:17,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:41:17,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 17:41:17,226 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 17:41:17,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:17,226 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 17:41:17,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:41:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 17:41:17,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:41:17,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:17,227 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 17:41:17,227 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:17,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:17,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2018-12-03 17:41:17,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:17,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:17,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:17,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:21,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:21,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:21,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:21,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:21,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:21,176 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:41:21,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:21,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:21,265 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:41:21,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:21,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:21,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:32,576 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:32,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:32,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:41:32,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:32,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:41:32,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:41:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:41:32,598 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 17:41:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:32,919 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 17:41:32,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:41:32,920 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 17:41:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:32,921 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:41:32,921 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:41:32,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:41:32,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:41:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:41:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:41:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 17:41:32,925 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 17:41:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:32,925 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 17:41:32,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:41:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 17:41:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:41:32,926 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:32,926 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 17:41:32,927 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:32,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:32,927 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2018-12-03 17:41:32,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:32,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:32,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:32,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:32,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:32,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:37,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:37,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:37,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:37,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:37,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:37,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:37,025 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:41:37,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:37,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:37,085 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:37,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:37,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:37,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:37,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:48,521 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:48,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:48,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:41:48,541 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:48,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:41:48,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:41:48,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:41:48,544 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 17:41:48,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:48,839 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 17:41:48,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:41:48,840 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 17:41:48,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:48,840 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:41:48,841 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:41:48,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:41:48,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:41:48,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:41:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:41:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 17:41:48,844 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 17:41:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:48,844 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 17:41:48,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:41:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 17:41:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:41:48,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:48,845 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 17:41:48,845 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2018-12-03 17:41:48,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:48,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:48,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:48,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:48,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:52,939 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:52,940 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:52,940 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:52,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:52,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:52,941 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:41:52,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:52,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:52,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:52,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:53,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:05,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:05,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:42:05,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:05,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:42:05,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:42:05,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:42:05,148 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 17:42:05,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:05,388 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 17:42:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:42:05,393 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 17:42:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:05,394 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:42:05,394 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:42:05,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:42:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:42:05,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:42:05,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:42:05,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 17:42:05,398 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 17:42:05,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:05,398 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 17:42:05,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:42:05,398 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 17:42:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:42:05,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:05,399 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 17:42:05,399 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:05,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:05,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2018-12-03 17:42:05,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:05,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:05,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:05,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:05,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:09,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:09,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:09,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:09,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:09,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:42:09,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:09,555 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:42:09,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:09,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:09,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 17:42:09,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:09,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:09,665 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:09,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:21,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:21,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:42:21,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:21,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:42:21,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:42:21,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:42:21,731 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 17:42:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:21,974 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 17:42:21,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:42:21,974 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 17:42:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:21,974 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:42:21,974 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:42:21,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:42:21,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:42:21,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:42:21,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:42:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 17:42:21,978 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 17:42:21,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:21,978 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 17:42:21,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:42:21,979 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 17:42:21,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:42:21,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:21,979 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 17:42:21,980 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:21,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:21,980 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2018-12-03 17:42:21,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:21,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:21,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:21,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:21,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:26,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:26,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:26,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:26,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:42:26,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:26,123 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:42:26,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:26,132 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:26,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:26,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:26,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:26,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:38,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:38,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:42:38,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:38,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:42:38,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:42:38,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:42:38,689 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 17:42:38,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:38,935 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 17:42:38,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:42:38,935 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 17:42:38,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:38,936 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:42:38,936 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:42:38,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:42:38,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:42:38,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:42:38,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:42:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 17:42:38,939 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 17:42:38,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:38,939 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 17:42:38,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:42:38,939 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 17:42:38,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:42:38,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:38,940 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 17:42:38,940 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:38,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:38,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2018-12-03 17:42:38,941 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:38,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:38,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:38,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:43,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:43,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:43,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:43,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:42:43,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:43,182 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:42:43,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:43,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:43,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:43,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:43,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:55,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:55,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:55,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:42:55,722 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:55,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:42:55,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:42:55,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:42:55,724 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 17:42:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:55,977 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 17:42:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:42:55,977 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 17:42:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:55,978 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:42:55,978 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:42:55,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:42:55,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:42:55,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:42:55,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:42:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 17:42:55,982 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 17:42:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:55,982 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 17:42:55,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:42:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 17:42:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:42:55,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:55,983 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 17:42:55,983 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:55,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2018-12-03 17:42:55,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:55,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:55,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:55,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:55,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:00,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:00,402 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:00,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:00,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:00,402 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:43:00,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:00,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:00,486 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 17:43:00,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:00,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:00,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:00,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:13,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:13,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:13,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:43:13,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:13,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:43:13,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:43:13,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:43:13,510 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 17:43:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:13,829 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 17:43:13,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:43:13,829 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 17:43:13,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:13,829 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:43:13,829 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:43:13,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:43:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:43:13,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:43:13,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:43:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:43:13,834 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 17:43:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:13,834 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:43:13,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:43:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:43:13,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:43:13,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:13,834 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 17:43:13,835 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:13,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:13,835 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2018-12-03 17:43:13,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:13,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:13,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:13,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:17,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:17,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:17,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:17,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:17,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:17,983 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:43:17,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:17,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:18,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:18,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:18,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:18,061 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:31,299 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:31,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:31,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:43:31,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:31,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:43:31,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:43:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:43:31,321 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 17:43:31,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:31,586 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 17:43:31,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:43:31,586 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 17:43:31,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:31,587 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:43:31,587 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:43:31,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:43:31,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:43:31,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:43:31,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:43:31,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 17:43:31,591 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 17:43:31,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:31,591 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 17:43:31,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:43:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 17:43:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:43:31,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:31,592 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 17:43:31,593 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:31,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:31,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2018-12-03 17:43:31,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:31,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:31,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:31,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:36,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:36,048 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:36,048 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:36,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:36,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:36,049 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:43:36,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:36,057 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:36,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:36,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:49,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:49,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:49,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:43:49,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:49,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:43:49,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:43:49,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:43:49,769 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 17:43:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:49,986 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 17:43:49,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:43:49,987 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 17:43:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:49,987 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:43:49,987 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:43:49,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:43:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:43:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:43:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:43:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:43:49,991 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 17:43:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:49,992 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:43:49,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:43:49,992 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:43:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:43:49,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:49,992 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 17:43:49,993 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:49,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:49,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2018-12-03 17:43:49,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:49,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:49,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:49,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:49,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:54,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:54,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:54,548 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:54,548 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:54,548 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:54,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:54,549 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:43:54,557 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:54,557 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:54,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 17:43:54,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:54,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:54,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:08,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:08,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 17:44:08,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:08,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 17:44:08,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 17:44:08,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:44:08,284 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 17:44:08,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:08,661 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 17:44:08,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 17:44:08,662 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 17:44:08,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:08,662 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:44:08,662 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:44:08,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:44:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:44:08,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 17:44:08,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:44:08,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 17:44:08,666 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 17:44:08,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:08,667 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 17:44:08,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 17:44:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 17:44:08,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:44:08,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:08,668 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 17:44:08,668 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:08,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:08,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2018-12-03 17:44:08,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:08,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:44:08,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:08,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:13,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:13,270 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:13,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:13,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:44:13,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:13,271 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:44:13,279 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:44:13,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:44:13,324 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:44:13,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:44:13,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:13,348 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:13,348 INFO L316 TraceCheckSpWp]: Computing backward predicates...