java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:55:37,157 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:55:37,159 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:55:37,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:55:37,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:55:37,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:55:37,178 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:55:37,183 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:55:37,186 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:55:37,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:55:37,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:55:37,192 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:55:37,193 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:55:37,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:55:37,202 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:55:37,203 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:55:37,204 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:55:37,208 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:55:37,210 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:55:37,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:55:37,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:55:37,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:55:37,225 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:55:37,225 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:55:37,226 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:55:37,227 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:55:37,227 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:55:37,228 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:55:37,232 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:55:37,235 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:55:37,235 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:55:37,237 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:55:37,238 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:55:37,238 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:55:37,239 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:55:37,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:55:37,240 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 21:55:37,265 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:55:37,265 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:55:37,266 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:55:37,267 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:55:37,267 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:55:37,267 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:55:37,267 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:55:37,267 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:55:37,268 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:55:37,268 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 21:55:37,269 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 21:55:37,269 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:55:37,269 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:55:37,270 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:55:37,270 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:55:37,270 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:55:37,272 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:55:37,273 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:55:37,273 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:55:37,273 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:55:37,273 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:55:37,273 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:55:37,274 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:55:37,274 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:55:37,274 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:55:37,275 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:55:37,275 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:55:37,275 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:55:37,275 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:55:37,276 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:55:37,276 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:55:37,276 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:55:37,276 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:55:37,276 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:55:37,277 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:55:37,278 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:55:37,278 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:55:37,278 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:55:37,278 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:55:37,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:55:37,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:55:37,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:55:37,355 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:55:37,356 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:55:37,356 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-01-07 21:55:37,357 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-01-07 21:55:37,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:55:37,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:55:37,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:55:37,400 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:55:37,400 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:55:37,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:55:37,445 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:55:37,445 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:55:37,445 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:55:37,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,460 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,465 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,467 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,468 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... [2019-01-07 21:55:37,470 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:55:37,470 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:55:37,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:55:37,470 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:55:37,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:55:37,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 21:55:37,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 21:55:37,787 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 21:55:37,787 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-07 21:55:37,789 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:55:37 BoogieIcfgContainer [2019-01-07 21:55:37,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:55:37,792 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:55:37,792 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:55:37,795 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:55:37,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:55:37" (1/2) ... [2019-01-07 21:55:37,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d5d035 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:55:37, skipping insertion in model container [2019-01-07 21:55:37,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:55:37" (2/2) ... [2019-01-07 21:55:37,800 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-01-07 21:55:37,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:55:37,822 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 21:55:37,844 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 21:55:37,888 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:55:37,888 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:55:37,888 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:55:37,889 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:55:37,889 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:55:37,889 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:55:37,889 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:55:37,890 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:55:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 21:55:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 21:55:37,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:37,917 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 21:55:37,920 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:37,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:37,928 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-07 21:55:37,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:37,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:37,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:37,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:37,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:38,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:55:38,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:55:38,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:55:38,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:55:38,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:55:38,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:55:38,098 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 21:55:38,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:38,130 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 21:55:38,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:55:38,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 21:55:38,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:38,144 INFO L225 Difference]: With dead ends: 9 [2019-01-07 21:55:38,144 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 21:55:38,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:55:38,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 21:55:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 21:55:38,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 21:55:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 21:55:38,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 21:55:38,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:38,184 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 21:55:38,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:55:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 21:55:38,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:55:38,185 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:38,185 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:55:38,186 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:38,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-07 21:55:38,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:38,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:38,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:38,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:38,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:38,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:38,321 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:38,325 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 21:55:38,330 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-07 21:55:38,417 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 21:55:38,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:55:40,115 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:55:40,116 INFO L272 AbstractInterpreter]: Visited 4 different actions 20 times. Merged at 1 different actions 8 times. Widened at 1 different actions 4 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-07 21:55:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:40,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:55:40,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:40,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:40,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:40,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:40,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:40,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:40,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:40,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-07 21:55:40,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:40,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:55:40,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:55:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 21:55:40,429 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-07 21:55:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:40,521 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-07 21:55:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:55:40,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:55:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:40,522 INFO L225 Difference]: With dead ends: 8 [2019-01-07 21:55:40,523 INFO L226 Difference]: Without dead ends: 6 [2019-01-07 21:55:40,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-07 21:55:40,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-07 21:55:40,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-07 21:55:40,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-07 21:55:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-07 21:55:40,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-07 21:55:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:40,527 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-07 21:55:40,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:55:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-07 21:55:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:55:40,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:40,529 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-07 21:55:40,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:40,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:40,532 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-07 21:55:40,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:40,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:40,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:40,534 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:40,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:40,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:40,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:40,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:40,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:40,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:40,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:40,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:40,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-07 21:55:40,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:40,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:40,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:40,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:40,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:40,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-07 21:55:40,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:40,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 21:55:40,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 21:55:40,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:55:40,812 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-07 21:55:40,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:40,873 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-07 21:55:40,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:55:40,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-07 21:55:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:40,875 INFO L225 Difference]: With dead ends: 9 [2019-01-07 21:55:40,875 INFO L226 Difference]: Without dead ends: 7 [2019-01-07 21:55:40,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-07 21:55:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-07 21:55:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-07 21:55:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 21:55:40,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-07 21:55:40,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-07 21:55:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:40,878 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-07 21:55:40,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 21:55:40,878 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-07 21:55:40,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-07 21:55:40,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:40,880 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-07 21:55:40,881 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:40,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:40,881 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-07 21:55:40,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:40,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:40,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:40,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:40,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:40,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:41,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:41,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:41,043 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:41,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:41,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:41,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:41,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:41,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:41,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:41,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:41,100 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:41,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:41,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:41,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:41,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-07 21:55:41,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:41,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-07 21:55:41,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-07 21:55:41,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:55:41,373 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-07 21:55:41,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:41,392 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-07 21:55:41,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:55:41,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-07 21:55:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:41,394 INFO L225 Difference]: With dead ends: 10 [2019-01-07 21:55:41,395 INFO L226 Difference]: Without dead ends: 8 [2019-01-07 21:55:41,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-07 21:55:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-07 21:55:41,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-07 21:55:41,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-07 21:55:41,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-07 21:55:41,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-07 21:55:41,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:41,399 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-07 21:55:41,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-07 21:55:41,400 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-07 21:55:41,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-07 21:55:41,400 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:41,400 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-07 21:55:41,400 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:41,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:41,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-07 21:55:41,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:41,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:41,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:41,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:41,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:41,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:41,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:41,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:41,592 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:41,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:41,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:41,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:41,623 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:41,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:41,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:41,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-07 21:55:41,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:41,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-07 21:55:41,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-07 21:55:41,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:55:41,897 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-07 21:55:41,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:41,933 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-07 21:55:41,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:55:41,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-07 21:55:41,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:41,935 INFO L225 Difference]: With dead ends: 11 [2019-01-07 21:55:41,935 INFO L226 Difference]: Without dead ends: 9 [2019-01-07 21:55:41,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-07 21:55:41,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-07 21:55:41,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-07 21:55:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-07 21:55:41,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-07 21:55:41,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-07 21:55:41,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:41,940 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-07 21:55:41,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-07 21:55:41,940 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-07 21:55:41,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:55:41,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:41,941 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-07 21:55:41,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-07 21:55:41,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:41,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:41,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:41,943 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:42,085 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:42,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:42,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:42,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:42,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:42,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:42,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:42,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-07 21:55:42,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:42,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:42,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:42,627 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:42,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-07 21:55:42,648 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:42,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:55:42,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:55:42,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:55:42,649 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-07 21:55:42,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:42,709 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-07 21:55:42,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:55:42,709 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-07 21:55:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:42,710 INFO L225 Difference]: With dead ends: 12 [2019-01-07 21:55:42,710 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 21:55:42,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:55:42,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 21:55:42,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-07 21:55:42,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-07 21:55:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-07 21:55:42,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-07 21:55:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:42,713 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-07 21:55:42,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:55:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-07 21:55:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-07 21:55:42,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:42,714 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-07 21:55:42,714 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:42,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-07 21:55:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:42,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:42,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:42,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:42,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:42,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:42,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:42,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:42,893 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:42,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:42,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:42,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:42,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:42,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:43,078 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:43,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:43,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-07 21:55:43,097 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:43,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-07 21:55:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-07 21:55:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:55:43,099 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-07 21:55:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:43,119 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-07 21:55:43,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:55:43,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-07 21:55:43,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:43,121 INFO L225 Difference]: With dead ends: 13 [2019-01-07 21:55:43,121 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 21:55:43,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-07 21:55:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 21:55:43,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 21:55:43,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 21:55:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-07 21:55:43,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-07 21:55:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:43,125 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-07 21:55:43,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-07 21:55:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 21:55:43,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:55:43,126 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:43,126 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-07 21:55:43,126 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:43,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:43,127 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-07 21:55:43,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:43,128 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:43,128 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:43,279 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:43,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:43,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:43,280 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:43,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:43,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:43,280 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:43,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:43,289 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:43,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:43,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:44,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:44,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-07 21:55:44,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:44,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:55:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:55:44,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:55:44,201 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-07 21:55:44,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:44,227 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-07 21:55:44,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:55:44,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-07 21:55:44,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:44,237 INFO L225 Difference]: With dead ends: 14 [2019-01-07 21:55:44,237 INFO L226 Difference]: Without dead ends: 12 [2019-01-07 21:55:44,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:55:44,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-07 21:55:44,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-07 21:55:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-07 21:55:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-07 21:55:44,240 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-07 21:55:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:44,241 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-07 21:55:44,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:55:44,241 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-07 21:55:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-07 21:55:44,241 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:44,241 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-07 21:55:44,242 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:44,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-07 21:55:44,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:44,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:44,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:44,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:44,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:44,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:44,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:44,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:44,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:44,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:44,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:44,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-07 21:55:44,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:44,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:44,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:44,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:44,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-07 21:55:44,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:44,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-07 21:55:44,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-07 21:55:44,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:55:44,818 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-07 21:55:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:44,862 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-07 21:55:44,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:55:44,863 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-07 21:55:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:44,864 INFO L225 Difference]: With dead ends: 15 [2019-01-07 21:55:44,864 INFO L226 Difference]: Without dead ends: 13 [2019-01-07 21:55:44,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:55:44,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-07 21:55:44,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-07 21:55:44,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-07 21:55:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-07 21:55:44,867 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-07 21:55:44,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:44,868 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-07 21:55:44,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-07 21:55:44,868 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-07 21:55:44,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-07 21:55:44,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:44,868 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-07 21:55:44,869 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:44,869 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-07 21:55:44,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:44,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:44,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:44,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:44,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:44,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:44,997 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:44,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:44,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:44,997 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:45,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:45,033 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:45,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:45,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:45,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:45,478 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:45,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:45,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-07 21:55:45,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:45,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:55:45,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:55:45,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:55:45,501 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-07 21:55:45,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:45,530 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-07 21:55:45,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:55:45,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-07 21:55:45,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:45,532 INFO L225 Difference]: With dead ends: 16 [2019-01-07 21:55:45,532 INFO L226 Difference]: Without dead ends: 14 [2019-01-07 21:55:45,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:55:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-07 21:55:45,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-07 21:55:45,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-07 21:55:45,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-07 21:55:45,536 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-07 21:55:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:45,536 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-07 21:55:45,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:55:45,536 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-07 21:55:45,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-07 21:55:45,537 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:45,537 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-07 21:55:45,537 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:45,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:45,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-07 21:55:45,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:45,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:45,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:45,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:45,539 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:45,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:45,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:45,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:45,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:45,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:45,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:45,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:45,661 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:45,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:45,681 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:45,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:45,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:45,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-07 21:55:45,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:45,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-07 21:55:45,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-07 21:55:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:55:45,914 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-07 21:55:45,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:45,991 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-07 21:55:45,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 21:55:45,991 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-07 21:55:45,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:45,991 INFO L225 Difference]: With dead ends: 17 [2019-01-07 21:55:45,992 INFO L226 Difference]: Without dead ends: 15 [2019-01-07 21:55:45,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-07 21:55:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-07 21:55:45,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-07 21:55:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-07 21:55:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-07 21:55:45,996 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-07 21:55:45,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:45,996 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-07 21:55:45,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-07 21:55:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-07 21:55:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-07 21:55:45,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:45,997 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-07 21:55:45,997 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:45,997 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-07 21:55:45,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:45,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:45,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:45,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:45,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:46,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:46,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:46,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:46,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:46,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:46,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:46,382 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:46,383 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:46,432 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-07 21:55:46,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:46,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:46,440 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:46,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:46,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:46,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-07 21:55:46,917 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:46,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:55:46,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:55:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:55:46,918 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-07 21:55:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:46,951 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-07 21:55:46,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 21:55:46,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-07 21:55:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:46,952 INFO L225 Difference]: With dead ends: 18 [2019-01-07 21:55:46,952 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 21:55:46,952 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 [2019-01-07 21:55:46,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 21:55:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-07 21:55:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 21:55:46,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-07 21:55:46,956 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-07 21:55:46,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:46,956 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-07 21:55:46,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:55:46,956 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-07 21:55:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-07 21:55:46,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:46,957 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-07 21:55:46,957 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-07 21:55:46,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:46,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:46,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:47,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:47,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:47,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:47,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:47,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:47,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:47,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:47,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:47,198 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:47,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:47,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:47,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:47,510 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:47,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:47,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-07 21:55:47,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:47,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-07 21:55:47,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-07 21:55:47,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-07 21:55:47,538 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-07 21:55:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:47,609 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-07 21:55:47,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 21:55:47,612 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-07 21:55:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:47,613 INFO L225 Difference]: With dead ends: 19 [2019-01-07 21:55:47,613 INFO L226 Difference]: Without dead ends: 17 [2019-01-07 21:55:47,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-07 21:55:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-07 21:55:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-07 21:55:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-07 21:55:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-07 21:55:47,624 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-07 21:55:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:47,624 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-07 21:55:47,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-07 21:55:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-07 21:55:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-07 21:55:47,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:47,625 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-07 21:55:47,625 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-07 21:55:47,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:47,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:47,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:47,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:47,888 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:47,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:47,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:47,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:47,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:47,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:47,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:47,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:47,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:47,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:47,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:48,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:48,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-07 21:55:48,406 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:48,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 21:55:48,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 21:55:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-07 21:55:48,407 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-07 21:55:48,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:48,470 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-07 21:55:48,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 21:55:48,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-07 21:55:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:48,474 INFO L225 Difference]: With dead ends: 20 [2019-01-07 21:55:48,474 INFO L226 Difference]: Without dead ends: 18 [2019-01-07 21:55:48,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-07 21:55:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-07 21:55:48,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-07 21:55:48,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-07 21:55:48,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-07 21:55:48,478 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-07 21:55:48,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:48,479 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-07 21:55:48,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 21:55:48,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-07 21:55:48,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-07 21:55:48,479 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:48,479 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-07 21:55:48,480 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:48,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:48,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-07 21:55:48,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:48,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:48,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:48,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:48,942 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:48,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:48,943 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:48,943 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:48,943 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:48,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:48,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:48,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:48,952 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:48,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-07 21:55:48,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:48,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:48,977 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:48,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:49,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:49,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-07 21:55:49,334 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:49,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-07 21:55:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-07 21:55:49,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:55:49,336 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-07 21:55:49,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:49,376 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-07 21:55:49,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-07 21:55:49,376 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-07 21:55:49,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:49,377 INFO L225 Difference]: With dead ends: 21 [2019-01-07 21:55:49,377 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 21:55:49,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:55:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 21:55:49,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-07 21:55:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-07 21:55:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-07 21:55:49,382 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-07 21:55:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:49,382 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-07 21:55:49,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-07 21:55:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-07 21:55:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-07 21:55:49,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:49,383 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-07 21:55:49,383 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:49,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-07 21:55:49,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:49,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:49,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:49,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:49,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:49,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:49,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:49,657 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:49,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:49,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:49,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:49,667 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:49,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:49,678 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:49,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:49,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:49,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:50,055 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:50,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:50,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-07 21:55:50,076 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:50,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 21:55:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 21:55:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:55:50,077 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-07 21:55:50,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:50,117 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-07 21:55:50,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-07 21:55:50,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-07 21:55:50,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:50,118 INFO L225 Difference]: With dead ends: 22 [2019-01-07 21:55:50,118 INFO L226 Difference]: Without dead ends: 20 [2019-01-07 21:55:50,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:55:50,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-07 21:55:50,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-07 21:55:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-07 21:55:50,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-07 21:55:50,122 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-07 21:55:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:50,123 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-07 21:55:50,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 21:55:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-07 21:55:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-07 21:55:50,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:50,123 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-07 21:55:50,124 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-07 21:55:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:50,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:50,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:50,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:50,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:50,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:50,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:50,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:50,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:50,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:50,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:50,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:50,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:50,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:51,985 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:52,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:52,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-07 21:55:52,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:52,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-07 21:55:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-07 21:55:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-07 21:55:52,007 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-07 21:55:52,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:52,036 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-07 21:55:52,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 21:55:52,038 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-07 21:55:52,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:52,038 INFO L225 Difference]: With dead ends: 23 [2019-01-07 21:55:52,038 INFO L226 Difference]: Without dead ends: 21 [2019-01-07 21:55:52,039 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 [2019-01-07 21:55:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-07 21:55:52,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-07 21:55:52,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 21:55:52,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-07 21:55:52,042 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-07 21:55:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:52,043 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-07 21:55:52,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-07 21:55:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-07 21:55:52,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 21:55:52,043 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:52,043 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-07 21:55:52,044 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:52,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:52,044 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-07 21:55:52,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:52,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:52,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:52,045 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:52,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:52,284 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:52,284 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:52,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:52,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:52,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:52,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:52,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:52,319 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-07 21:55:52,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:52,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:52,326 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:52,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:53,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:53,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-07 21:55:53,153 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:53,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 21:55:53,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 21:55:53,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:55:53,154 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-07 21:55:53,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:53,255 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-07 21:55:53,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 21:55:53,256 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-07 21:55:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:53,256 INFO L225 Difference]: With dead ends: 24 [2019-01-07 21:55:53,256 INFO L226 Difference]: Without dead ends: 22 [2019-01-07 21:55:53,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:55:53,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-07 21:55:53,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-07 21:55:53,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-07 21:55:53,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-07 21:55:53,261 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-07 21:55:53,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:53,261 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-07 21:55:53,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-07 21:55:53,261 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-07 21:55:53,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-07 21:55:53,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:53,262 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-07 21:55:53,262 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:53,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:53,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-07 21:55:53,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:53,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:53,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:53,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:53,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:53,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:53,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:53,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:53,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:53,951 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:53,960 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:53,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:53,976 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:53,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:53,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:53,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:54,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:54,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-07 21:55:54,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:54,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-07 21:55:54,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-07 21:55:54,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-07 21:55:54,576 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-07 21:55:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:54,678 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-07 21:55:54,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-07 21:55:54,679 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-07 21:55:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:54,680 INFO L225 Difference]: With dead ends: 25 [2019-01-07 21:55:54,680 INFO L226 Difference]: Without dead ends: 23 [2019-01-07 21:55:54,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-07 21:55:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-07 21:55:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-07 21:55:54,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-07 21:55:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-07 21:55:54,685 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-07 21:55:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:54,686 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-07 21:55:54,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-07 21:55:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-07 21:55:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-07 21:55:54,687 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:54,687 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-07 21:55:54,687 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:54,688 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-07 21:55:54,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:54,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:54,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:54,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:54,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:55,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:55,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:55,001 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:55,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:55,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:55,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:55,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:55,020 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:55,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:55,059 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:55,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:55,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:55,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-07 21:55:55,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:55,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-07 21:55:55,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-07 21:55:55,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 21:55:55,566 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-07 21:55:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:55,637 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-07 21:55:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-07 21:55:55,640 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-07 21:55:55,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:55,640 INFO L225 Difference]: With dead ends: 26 [2019-01-07 21:55:55,640 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 21:55:55,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 21:55:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 21:55:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-07 21:55:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-07 21:55:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-07 21:55:55,644 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-07 21:55:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:55,644 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-07 21:55:55,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-07 21:55:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-07 21:55:55,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-07 21:55:55,645 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:55,645 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-07 21:55:55,645 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:55,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:55,645 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-07 21:55:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:55,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:55,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:55,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:55,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:55,953 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:55,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:55,953 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:55,953 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:55,953 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:55,953 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:55,954 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:55,963 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:55:55,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:55:55,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-07 21:55:55,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:55,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:55,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:56,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:56,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-07 21:55:56,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:56,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-07 21:55:56,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-07 21:55:56,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:55:56,744 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-07 21:55:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:56,788 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-07 21:55:56,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-07 21:55:56,789 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-07 21:55:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:56,789 INFO L225 Difference]: With dead ends: 27 [2019-01-07 21:55:56,789 INFO L226 Difference]: Without dead ends: 25 [2019-01-07 21:55:56,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:55:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-07 21:55:56,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-07 21:55:56,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-07 21:55:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-07 21:55:56,793 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-07 21:55:56,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:56,794 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-07 21:55:56,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-07 21:55:56,794 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-07 21:55:56,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-07 21:55:56,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:56,795 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-07 21:55:56,795 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:56,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:56,795 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-07 21:55:56,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:56,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:56,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:56,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:57,697 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:57,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:57,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:57,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:57,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:57,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:57,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:57,705 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:55:57,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:55:57,731 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:55:57,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:55:57,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:57,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:55:58,493 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:58,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:55:58,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-07 21:55:58,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:55:58,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-07 21:55:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-07 21:55:58,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 21:55:58,517 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-07 21:55:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:55:58,599 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-07 21:55:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-07 21:55:58,603 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-07 21:55:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:55:58,603 INFO L225 Difference]: With dead ends: 28 [2019-01-07 21:55:58,603 INFO L226 Difference]: Without dead ends: 26 [2019-01-07 21:55:58,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 21:55:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-07 21:55:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-07 21:55:58,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 21:55:58,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-07 21:55:58,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-07 21:55:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:55:58,607 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-07 21:55:58,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-07 21:55:58,608 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-07 21:55:58,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-07 21:55:58,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:55:58,608 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-07 21:55:58,609 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:55:58,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:55:58,609 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-07 21:55:58,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:55:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:58,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:55:58,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:55:58,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:55:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:59,826 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:59,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:59,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:55:59,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:55:59,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:55:59,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:55:59,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:55:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:55:59,837 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:55:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:55:59,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:55:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:55:59,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:00,465 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:00,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-07 21:56:00,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:00,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-07 21:56:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-07 21:56:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-07 21:56:00,486 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-07 21:56:00,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:00,525 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-07 21:56:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-07 21:56:00,527 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-07 21:56:00,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:00,528 INFO L225 Difference]: With dead ends: 29 [2019-01-07 21:56:00,528 INFO L226 Difference]: Without dead ends: 27 [2019-01-07 21:56:00,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-07 21:56:00,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-07 21:56:00,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-07 21:56:00,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-07 21:56:00,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-07 21:56:00,533 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-07 21:56:00,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:00,533 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-07 21:56:00,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-07 21:56:00,534 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-07 21:56:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-07 21:56:00,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:00,534 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-07 21:56:00,535 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-07 21:56:00,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:00,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:00,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:00,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:00,926 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:00,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:00,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:00,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:00,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:00,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:00,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:00,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:00,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:00,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-07 21:56:00,971 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:00,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:00,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:02,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:02,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-07 21:56:02,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:02,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 21:56:02,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 21:56:02,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:56:02,171 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-07 21:56:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:02,222 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-07 21:56:02,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 21:56:02,222 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-07 21:56:02,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:02,223 INFO L225 Difference]: With dead ends: 30 [2019-01-07 21:56:02,223 INFO L226 Difference]: Without dead ends: 28 [2019-01-07 21:56:02,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:56:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-07 21:56:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-07 21:56:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-07 21:56:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-07 21:56:02,229 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-07 21:56:02,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:02,230 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-07 21:56:02,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 21:56:02,230 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-07 21:56:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-07 21:56:02,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:02,231 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-07 21:56:02,231 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:02,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:02,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-07 21:56:02,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:02,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:02,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:02,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:02,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:02,666 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:02,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:02,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:02,666 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:02,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:02,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:02,666 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:02,675 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:02,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:02,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:02,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:02,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:02,705 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:02,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:03,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:03,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-07 21:56:03,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:03,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-07 21:56:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-07 21:56:03,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-07 21:56:03,458 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-07 21:56:03,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:03,516 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-07 21:56:03,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 21:56:03,516 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-07 21:56:03,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:03,517 INFO L225 Difference]: With dead ends: 31 [2019-01-07 21:56:03,517 INFO L226 Difference]: Without dead ends: 29 [2019-01-07 21:56:03,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-07 21:56:03,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-07 21:56:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-07 21:56:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-07 21:56:03,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-07 21:56:03,521 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-07 21:56:03,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:03,521 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-07 21:56:03,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-07 21:56:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-07 21:56:03,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-07 21:56:03,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:03,522 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-07 21:56:03,523 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:03,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:03,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-07 21:56:03,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:03,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:03,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:03,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:03,948 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:03,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:03,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:03,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:03,949 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:03,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:03,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:03,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:03,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:03,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:03,986 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:03,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:05,414 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:05,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:05,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-07 21:56:05,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:05,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-07 21:56:05,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-07 21:56:05,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 21:56:05,436 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-07 21:56:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:05,502 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-07 21:56:05,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-07 21:56:05,503 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-07 21:56:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:05,504 INFO L225 Difference]: With dead ends: 32 [2019-01-07 21:56:05,504 INFO L226 Difference]: Without dead ends: 30 [2019-01-07 21:56:05,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 21:56:05,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-07 21:56:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-07 21:56:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-07 21:56:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-07 21:56:05,509 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-07 21:56:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:05,509 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-07 21:56:05,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-07 21:56:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-07 21:56:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-07 21:56:05,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:05,510 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-07 21:56:05,510 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:05,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-07 21:56:05,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:05,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:05,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:06,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:06,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:06,337 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:06,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:06,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:06,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:06,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:06,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-07 21:56:06,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:06,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:06,408 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:06,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:07,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:07,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-07 21:56:07,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:07,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-07 21:56:07,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-07 21:56:07,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 21:56:07,545 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-07 21:56:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:07,707 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-07 21:56:07,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-07 21:56:07,708 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-07 21:56:07,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:07,709 INFO L225 Difference]: With dead ends: 33 [2019-01-07 21:56:07,709 INFO L226 Difference]: Without dead ends: 31 [2019-01-07 21:56:07,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 21:56:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-07 21:56:07,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-07 21:56:07,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:56:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-07 21:56:07,714 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-07 21:56:07,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:07,714 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-07 21:56:07,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-07 21:56:07,714 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-07 21:56:07,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-07 21:56:07,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:07,715 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-07 21:56:07,715 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:07,715 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-07 21:56:07,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:07,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:07,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:07,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:07,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:08,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:08,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:08,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:08,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:08,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:08,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:08,478 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:08,478 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:08,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:08,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:08,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:08,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:09,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:09,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-07 21:56:09,439 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:09,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-07 21:56:09,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-07 21:56:09,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 21:56:09,441 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-07 21:56:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:09,475 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-07 21:56:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-07 21:56:09,475 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-07 21:56:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:09,476 INFO L225 Difference]: With dead ends: 34 [2019-01-07 21:56:09,476 INFO L226 Difference]: Without dead ends: 32 [2019-01-07 21:56:09,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 21:56:09,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-07 21:56:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-07 21:56:09,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-07 21:56:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-07 21:56:09,482 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-07 21:56:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:09,483 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-07 21:56:09,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-07 21:56:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-07 21:56:09,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-07 21:56:09,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:09,484 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-07 21:56:09,484 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:09,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-07 21:56:09,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:09,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:09,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:09,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:09,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:09,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:09,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:09,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:09,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:09,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:09,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:09,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:09,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:09,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:11,031 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:11,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:11,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-07 21:56:11,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:11,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-07 21:56:11,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-07 21:56:11,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-07 21:56:11,054 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-07 21:56:11,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:11,133 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-07 21:56:11,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 21:56:11,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-07 21:56:11,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:11,134 INFO L225 Difference]: With dead ends: 35 [2019-01-07 21:56:11,135 INFO L226 Difference]: Without dead ends: 33 [2019-01-07 21:56:11,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-07 21:56:11,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-07 21:56:11,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-07 21:56:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-07 21:56:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-07 21:56:11,140 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-07 21:56:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:11,140 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-07 21:56:11,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-07 21:56:11,140 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-07 21:56:11,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-07 21:56:11,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:11,141 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-07 21:56:11,141 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:11,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:11,142 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-07 21:56:11,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:11,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:11,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:11,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:11,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:11,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:12,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:12,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:12,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:12,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:12,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:12,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:12,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:12,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:12,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-07 21:56:12,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:12,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:12,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:13,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:13,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-07 21:56:13,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:13,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 21:56:13,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 21:56:13,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:56:13,382 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-07 21:56:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:13,476 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-07 21:56:13,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 21:56:13,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-07 21:56:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:13,478 INFO L225 Difference]: With dead ends: 36 [2019-01-07 21:56:13,478 INFO L226 Difference]: Without dead ends: 34 [2019-01-07 21:56:13,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:56:13,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-07 21:56:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-07 21:56:13,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-07 21:56:13,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-07 21:56:13,482 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-07 21:56:13,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:13,482 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-07 21:56:13,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 21:56:13,482 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-07 21:56:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-07 21:56:13,482 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:13,483 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-07 21:56:13,483 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:13,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:13,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-07 21:56:13,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:13,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:13,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:13,484 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:14,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:14,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:14,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:14,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:14,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:14,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:14,093 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:14,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:14,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:14,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:14,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:14,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:15,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:15,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-07 21:56:15,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:15,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-07 21:56:15,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-07 21:56:15,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-07 21:56:15,181 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-07 21:56:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:15,268 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-07 21:56:15,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-07 21:56:15,269 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-07 21:56:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:15,269 INFO L225 Difference]: With dead ends: 37 [2019-01-07 21:56:15,269 INFO L226 Difference]: Without dead ends: 35 [2019-01-07 21:56:15,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-07 21:56:15,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-07 21:56:15,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-07 21:56:15,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-07 21:56:15,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-07 21:56:15,274 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-07 21:56:15,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:15,274 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-07 21:56:15,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-07 21:56:15,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-07 21:56:15,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-07 21:56:15,275 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:15,275 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-07 21:56:15,275 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:15,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:15,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-07 21:56:15,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:15,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:15,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:15,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:15,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:15,762 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:15,763 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:15,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:15,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:15,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:15,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:15,772 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:15,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:15,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:17,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:17,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-07 21:56:17,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:17,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-07 21:56:17,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-07 21:56:17,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 21:56:17,232 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-07 21:56:17,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:17,304 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-07 21:56:17,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-07 21:56:17,304 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-07 21:56:17,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:17,305 INFO L225 Difference]: With dead ends: 38 [2019-01-07 21:56:17,305 INFO L226 Difference]: Without dead ends: 36 [2019-01-07 21:56:17,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 21:56:17,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-07 21:56:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-07 21:56:17,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 21:56:17,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-07 21:56:17,310 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-07 21:56:17,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:17,310 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-07 21:56:17,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-07 21:56:17,311 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-07 21:56:17,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-07 21:56:17,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:17,311 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-07 21:56:17,311 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:17,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:17,312 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-07 21:56:17,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:17,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:17,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:17,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:17,839 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:17,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:17,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:17,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:17,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:17,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:17,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:17,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:17,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-07 21:56:17,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:17,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:17,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:19,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:19,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-07 21:56:19,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:19,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-07 21:56:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-07 21:56:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 21:56:19,145 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-07 21:56:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:19,222 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-07 21:56:19,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 21:56:19,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-07 21:56:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:19,223 INFO L225 Difference]: With dead ends: 39 [2019-01-07 21:56:19,223 INFO L226 Difference]: Without dead ends: 37 [2019-01-07 21:56:19,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 21:56:19,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-07 21:56:19,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-07 21:56:19,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-07 21:56:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-07 21:56:19,227 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-07 21:56:19,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:19,228 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-07 21:56:19,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-07 21:56:19,228 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-07 21:56:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-07 21:56:19,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:19,228 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-07 21:56:19,228 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:19,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-07 21:56:19,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:19,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:19,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:19,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:19,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:19,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:19,960 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:19,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:19,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:19,960 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:19,970 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:19,971 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:19,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:19,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:19,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:20,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:21,315 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:21,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:21,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-07 21:56:21,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:21,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-07 21:56:21,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-07 21:56:21,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:56:21,337 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-07 21:56:21,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:21,443 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-07 21:56:21,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-07 21:56:21,444 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-07 21:56:21,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:21,445 INFO L225 Difference]: With dead ends: 40 [2019-01-07 21:56:21,445 INFO L226 Difference]: Without dead ends: 38 [2019-01-07 21:56:21,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:56:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-07 21:56:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-07 21:56:21,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-07 21:56:21,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-07 21:56:21,449 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-07 21:56:21,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:21,449 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-07 21:56:21,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-07 21:56:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-07 21:56:21,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-07 21:56:21,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:21,450 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-07 21:56:21,450 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:21,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-07 21:56:21,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:21,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:21,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:21,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:22,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:22,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:22,376 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:22,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:22,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:22,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:22,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:22,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:22,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:22,433 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:22,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:24,000 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:24,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:24,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-07 21:56:24,023 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:24,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-07 21:56:24,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-07 21:56:24,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-07 21:56:24,024 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-07 21:56:24,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:24,092 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-07 21:56:24,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 21:56:24,093 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-07 21:56:24,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:24,093 INFO L225 Difference]: With dead ends: 41 [2019-01-07 21:56:24,093 INFO L226 Difference]: Without dead ends: 39 [2019-01-07 21:56:24,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-07 21:56:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-07 21:56:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-07 21:56:24,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-07 21:56:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-07 21:56:24,097 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-07 21:56:24,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:24,098 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-07 21:56:24,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-07 21:56:24,098 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-07 21:56:24,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-07 21:56:24,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:24,099 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-07 21:56:24,099 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:24,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:24,099 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-07 21:56:24,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:24,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:24,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:24,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:24,637 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:24,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:24,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:24,638 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:24,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:24,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:24,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:24,646 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:24,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:24,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-07 21:56:24,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:24,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:24,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:26,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:26,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-07 21:56:26,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:26,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 21:56:26,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 21:56:26,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:56:26,182 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-07 21:56:26,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:26,232 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-07 21:56:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-07 21:56:26,233 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-07 21:56:26,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:26,233 INFO L225 Difference]: With dead ends: 42 [2019-01-07 21:56:26,234 INFO L226 Difference]: Without dead ends: 40 [2019-01-07 21:56:26,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:56:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-07 21:56:26,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-07 21:56:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-07 21:56:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-07 21:56:26,238 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-07 21:56:26,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:26,238 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-07 21:56:26,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 21:56:26,238 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-07 21:56:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-07 21:56:26,238 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:26,238 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-07 21:56:26,239 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-07 21:56:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:26,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:26,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:26,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:26,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:26,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:26,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:26,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:26,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:26,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:26,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:26,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:26,883 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:26,907 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:26,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:26,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:26,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:28,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:28,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-07 21:56:28,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:28,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-07 21:56:28,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-07 21:56:28,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-07 21:56:28,715 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-07 21:56:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:28,789 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-07 21:56:28,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 21:56:28,790 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-07 21:56:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:28,790 INFO L225 Difference]: With dead ends: 43 [2019-01-07 21:56:28,791 INFO L226 Difference]: Without dead ends: 41 [2019-01-07 21:56:28,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-07 21:56:28,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-07 21:56:28,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-07 21:56:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:56:28,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-07 21:56:28,794 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-07 21:56:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:28,794 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-07 21:56:28,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-07 21:56:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-07 21:56:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-07 21:56:28,795 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:28,795 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-07 21:56:28,795 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-07 21:56:28,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:28,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:28,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:28,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:28,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:30,295 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:30,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:30,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:30,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:30,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:30,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:30,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:30,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:30,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:30,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:30,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:31,969 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:31,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:31,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-07 21:56:31,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:31,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-07 21:56:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-07 21:56:31,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 21:56:31,991 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-07 21:56:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:32,109 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-07 21:56:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-07 21:56:32,109 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-07 21:56:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:32,109 INFO L225 Difference]: With dead ends: 44 [2019-01-07 21:56:32,110 INFO L226 Difference]: Without dead ends: 42 [2019-01-07 21:56:32,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 21:56:32,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-07 21:56:32,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-07 21:56:32,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-07 21:56:32,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-07 21:56:32,113 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-07 21:56:32,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:32,113 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-07 21:56:32,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-07 21:56:32,114 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-07 21:56:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-07 21:56:32,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:32,114 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-07 21:56:32,114 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-07 21:56:32,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:32,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:32,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:32,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:32,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:32,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:32,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:32,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:32,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:32,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:32,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:32,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:32,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-07 21:56:32,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:32,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:32,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:34,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:34,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-07 21:56:34,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:34,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-07 21:56:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-07 21:56:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:56:34,950 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-07 21:56:35,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:35,026 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-07 21:56:35,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-07 21:56:35,026 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-07 21:56:35,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:35,027 INFO L225 Difference]: With dead ends: 45 [2019-01-07 21:56:35,027 INFO L226 Difference]: Without dead ends: 43 [2019-01-07 21:56:35,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:56:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-07 21:56:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-07 21:56:35,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-07 21:56:35,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-07 21:56:35,033 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-07 21:56:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:35,033 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-07 21:56:35,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-07 21:56:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-07 21:56:35,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-07 21:56:35,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:35,034 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-07 21:56:35,035 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:35,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:35,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-07 21:56:35,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:35,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:35,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:35,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:35,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:35,702 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:35,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:35,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:35,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:35,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:35,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:35,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:35,712 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:35,712 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:35,739 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:35,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:35,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:35,748 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:35,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:37,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:37,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-07 21:56:37,765 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:37,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-07 21:56:37,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-07 21:56:37,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-07 21:56:37,766 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-07 21:56:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:37,844 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-07 21:56:37,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-07 21:56:37,845 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-07 21:56:37,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:37,845 INFO L225 Difference]: With dead ends: 46 [2019-01-07 21:56:37,845 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 21:56:37,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-07 21:56:37,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 21:56:37,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-07 21:56:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-07 21:56:37,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-07 21:56:37,848 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-07 21:56:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:37,848 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-07 21:56:37,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-07 21:56:37,848 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-07 21:56:37,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-07 21:56:37,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:37,849 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-07 21:56:37,849 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:37,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:37,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-07 21:56:37,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:37,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:37,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:38,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:38,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:38,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:38,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:38,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:38,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:38,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:38,628 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:38,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:38,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:40,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:40,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-07 21:56:40,734 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:40,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-07 21:56:40,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-07 21:56:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-07 21:56:40,735 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-07 21:56:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:40,841 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-07 21:56:40,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-07 21:56:40,843 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-07 21:56:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:40,844 INFO L225 Difference]: With dead ends: 47 [2019-01-07 21:56:40,844 INFO L226 Difference]: Without dead ends: 45 [2019-01-07 21:56:40,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-07 21:56:40,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-07 21:56:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-07 21:56:40,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-07 21:56:40,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-07 21:56:40,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-07 21:56:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:40,846 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-07 21:56:40,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-07 21:56:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-07 21:56:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-07 21:56:40,847 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:40,847 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-07 21:56:40,847 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:40,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:40,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-07 21:56:40,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:40,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:40,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:40,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:40,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:42,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:42,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:42,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:42,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:42,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:42,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:42,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:42,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:43,088 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-07 21:56:43,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:43,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:43,100 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:43,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:45,055 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:45,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:45,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-07 21:56:45,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:45,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 21:56:45,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 21:56:45,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:56:45,076 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-07 21:56:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:45,151 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-07 21:56:45,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 21:56:45,152 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-07 21:56:45,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:45,153 INFO L225 Difference]: With dead ends: 48 [2019-01-07 21:56:45,153 INFO L226 Difference]: Without dead ends: 46 [2019-01-07 21:56:45,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:56:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-07 21:56:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-07 21:56:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-07 21:56:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-07 21:56:45,157 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-07 21:56:45,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:45,157 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-07 21:56:45,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 21:56:45,157 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-07 21:56:45,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-07 21:56:45,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:45,158 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-07 21:56:45,158 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:45,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-07 21:56:45,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:45,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:45,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:45,159 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:45,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:46,146 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:46,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:46,146 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:46,146 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:46,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:46,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:46,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:46,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:46,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:46,186 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:46,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:46,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:46,197 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:46,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:48,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:48,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-07 21:56:48,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:48,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-07 21:56:48,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-07 21:56:48,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-07 21:56:48,612 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-07 21:56:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:48,670 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-07 21:56:48,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-07 21:56:48,671 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-07 21:56:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:48,671 INFO L225 Difference]: With dead ends: 49 [2019-01-07 21:56:48,671 INFO L226 Difference]: Without dead ends: 47 [2019-01-07 21:56:48,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-07 21:56:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-07 21:56:48,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-07 21:56:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-07 21:56:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-07 21:56:48,674 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-07 21:56:48,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:48,675 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-07 21:56:48,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-07 21:56:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-07 21:56:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-07 21:56:48,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:48,675 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-07 21:56:48,675 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:48,676 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-07 21:56:48,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:48,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:48,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:48,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:48,677 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:49,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:49,924 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:49,924 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:49,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:49,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:49,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:49,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:56:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:49,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:49,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:52,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:52,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-07 21:56:52,061 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:52,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-07 21:56:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-07 21:56:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-07 21:56:52,062 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-07 21:56:52,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:52,214 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-07 21:56:52,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-07 21:56:52,214 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-07 21:56:52,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:52,215 INFO L225 Difference]: With dead ends: 50 [2019-01-07 21:56:52,215 INFO L226 Difference]: Without dead ends: 48 [2019-01-07 21:56:52,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-07 21:56:52,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-07 21:56:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-07 21:56:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-07 21:56:52,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-07 21:56:52,217 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-07 21:56:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:52,218 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-07 21:56:52,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-07 21:56:52,218 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-07 21:56:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-07 21:56:52,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:52,218 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-07 21:56:52,218 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-07 21:56:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:52,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:56:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:52,220 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:53,401 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:53,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:53,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:53,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:53,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:53,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:53,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:53,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:56:53,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:56:53,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-07 21:56:53,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:53,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:53,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:55,698 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:55,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:55,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-07 21:56:55,718 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:55,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-07 21:56:55,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-07 21:56:55,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:56:55,719 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-07 21:56:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:55,777 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-07 21:56:55,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-07 21:56:55,777 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-07 21:56:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:55,778 INFO L225 Difference]: With dead ends: 51 [2019-01-07 21:56:55,778 INFO L226 Difference]: Without dead ends: 49 [2019-01-07 21:56:55,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:56:55,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-07 21:56:55,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-07 21:56:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-07 21:56:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-07 21:56:55,782 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-07 21:56:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:55,782 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-07 21:56:55,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-07 21:56:55,782 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-07 21:56:55,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-07 21:56:55,783 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:55,783 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-07 21:56:55,783 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:55,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:55,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-07 21:56:55,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:55,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:55,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:55,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:56:56,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:56,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:56,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:56:56,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:56:56,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:56:56,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:56:56,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:56:56,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:56:56,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:56:56,713 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:56:56,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:56:56,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:56:56,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:56,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:56:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:56:59,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:56:59,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-07 21:56:59,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:56:59,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-07 21:56:59,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-07 21:56:59,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:56:59,461 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-07 21:56:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:56:59,819 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-07 21:56:59,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-07 21:56:59,820 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-07 21:56:59,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:56:59,821 INFO L225 Difference]: With dead ends: 52 [2019-01-07 21:56:59,821 INFO L226 Difference]: Without dead ends: 50 [2019-01-07 21:56:59,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:56:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-07 21:56:59,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-07 21:56:59,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-07 21:56:59,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-07 21:56:59,825 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-07 21:56:59,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:56:59,825 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-07 21:56:59,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-07 21:56:59,825 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-07 21:56:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-07 21:56:59,826 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:56:59,826 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-07 21:56:59,826 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:56:59,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:56:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-07 21:56:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:56:59,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:59,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:56:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:56:59,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:56:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:00,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:00,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:00,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:00,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:00,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:00,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:00,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:00,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:00,768 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:00,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:00,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:00,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:03,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-07 21:57:03,502 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:03,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-07 21:57:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-07 21:57:03,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-07 21:57:03,504 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-07 21:57:03,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:03,597 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-07 21:57:03,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-07 21:57:03,598 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-07 21:57:03,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:03,599 INFO L225 Difference]: With dead ends: 53 [2019-01-07 21:57:03,599 INFO L226 Difference]: Without dead ends: 51 [2019-01-07 21:57:03,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-07 21:57:03,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-07 21:57:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-07 21:57:03,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-07 21:57:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-07 21:57:03,602 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-07 21:57:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:03,602 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-07 21:57:03,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-07 21:57:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-07 21:57:03,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-07 21:57:03,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:03,602 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-07 21:57:03,603 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:03,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:03,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-07 21:57:03,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:03,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:03,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:03,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:03,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:04,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:04,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:04,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:04,891 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:04,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:04,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:04,891 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:04,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:04,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:05,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-07 21:57:05,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:05,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:05,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:05,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:07,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:07,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:07,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-07 21:57:07,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:07,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 21:57:07,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 21:57:07,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:57:07,818 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-07 21:57:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:07,927 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-07 21:57:07,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 21:57:07,927 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-07 21:57:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:07,928 INFO L225 Difference]: With dead ends: 54 [2019-01-07 21:57:07,928 INFO L226 Difference]: Without dead ends: 52 [2019-01-07 21:57:07,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:57:07,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-07 21:57:07,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-07 21:57:07,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-07 21:57:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-07 21:57:07,931 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-07 21:57:07,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:07,932 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-07 21:57:07,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 21:57:07,932 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-07 21:57:07,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-07 21:57:07,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:07,933 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-07 21:57:07,933 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:07,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:07,933 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-07 21:57:07,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:07,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:07,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:07,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:09,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:09,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:09,011 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:09,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:09,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:09,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:09,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:09,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:09,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:09,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:09,056 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:09,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:11,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:11,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-07 21:57:11,894 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:11,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-07 21:57:11,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-07 21:57:11,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-07 21:57:11,898 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-07 21:57:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:12,043 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-07 21:57:12,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-07 21:57:12,044 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-07 21:57:12,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:12,044 INFO L225 Difference]: With dead ends: 55 [2019-01-07 21:57:12,044 INFO L226 Difference]: Without dead ends: 53 [2019-01-07 21:57:12,045 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 [2019-01-07 21:57:12,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-07 21:57:12,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-07 21:57:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-07 21:57:12,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-07 21:57:12,048 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-07 21:57:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:12,049 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-07 21:57:12,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-07 21:57:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-07 21:57:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-07 21:57:12,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:12,049 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-07 21:57:12,050 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:12,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-07 21:57:12,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:12,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:12,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:12,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:12,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:13,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:13,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:13,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:13,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:13,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:13,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:13,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:13,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:13,460 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:13,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:13,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:16,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:16,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:16,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-07 21:57:16,162 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:16,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-07 21:57:16,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-07 21:57:16,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 21:57:16,163 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-07 21:57:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:16,224 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-07 21:57:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-07 21:57:16,224 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-07 21:57:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:16,225 INFO L225 Difference]: With dead ends: 56 [2019-01-07 21:57:16,225 INFO L226 Difference]: Without dead ends: 54 [2019-01-07 21:57:16,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 21:57:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-07 21:57:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-07 21:57:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-07 21:57:16,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-07 21:57:16,229 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-07 21:57:16,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:16,230 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-07 21:57:16,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-07 21:57:16,230 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-07 21:57:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-07 21:57:16,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:16,230 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-07 21:57:16,230 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:16,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-07 21:57:16,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:16,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:16,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:17,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:17,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:17,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:17,274 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:17,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:17,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:17,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:17,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:17,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:17,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-07 21:57:17,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:17,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:17,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:17,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:20,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:20,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-07 21:57:20,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:20,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-07 21:57:20,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-07 21:57:20,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:57:20,715 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-07 21:57:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:20,909 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-07 21:57:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-07 21:57:20,910 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-07 21:57:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:20,911 INFO L225 Difference]: With dead ends: 57 [2019-01-07 21:57:20,911 INFO L226 Difference]: Without dead ends: 55 [2019-01-07 21:57:20,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:57:20,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-07 21:57:20,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-07 21:57:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-07 21:57:20,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-07 21:57:20,914 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-07 21:57:20,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:20,914 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-07 21:57:20,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-07 21:57:20,914 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-07 21:57:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-07 21:57:20,915 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:20,915 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-07 21:57:20,915 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:20,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:20,916 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-07 21:57:20,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:20,916 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:20,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:20,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:22,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:22,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:22,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:22,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:22,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:22,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:22,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:22,120 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:22,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:22,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:22,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:22,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:22,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:25,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:25,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:25,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-07 21:57:25,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:25,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-07 21:57:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-07 21:57:25,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 21:57:25,363 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-07 21:57:25,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:25,457 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-07 21:57:25,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-07 21:57:25,457 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-07 21:57:25,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:25,458 INFO L225 Difference]: With dead ends: 58 [2019-01-07 21:57:25,458 INFO L226 Difference]: Without dead ends: 56 [2019-01-07 21:57:25,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 21:57:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-07 21:57:25,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-07 21:57:25,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-07 21:57:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-07 21:57:25,462 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-07 21:57:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:25,462 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-07 21:57:25,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-07 21:57:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-07 21:57:25,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-07 21:57:25,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:25,463 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-07 21:57:25,463 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:25,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:25,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-07 21:57:25,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:25,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:25,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:25,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:26,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:26,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:26,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:26,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:26,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:26,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:26,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:26,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:26,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:26,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:26,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:29,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:29,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:29,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-07 21:57:29,953 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:29,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-07 21:57:29,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-07 21:57:29,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-07 21:57:29,955 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-07 21:57:30,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:30,062 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-07 21:57:30,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-07 21:57:30,062 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-07 21:57:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:30,063 INFO L225 Difference]: With dead ends: 59 [2019-01-07 21:57:30,063 INFO L226 Difference]: Without dead ends: 57 [2019-01-07 21:57:30,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-07 21:57:30,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-07 21:57:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-07 21:57:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-07 21:57:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-07 21:57:30,066 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-07 21:57:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:30,066 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-07 21:57:30,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-07 21:57:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-07 21:57:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-07 21:57:30,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:30,067 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-07 21:57:30,067 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:30,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-07 21:57:30,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:30,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:30,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:30,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:30,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:31,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:31,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:31,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:31,291 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:31,291 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:31,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:31,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:31,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:31,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:31,538 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-07 21:57:31,539 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:31,542 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:31,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:34,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:34,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:34,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-07 21:57:34,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:34,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-07 21:57:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-07 21:57:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:57:34,998 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-07 21:57:35,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:35,072 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-07 21:57:35,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-07 21:57:35,073 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-07 21:57:35,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:35,074 INFO L225 Difference]: With dead ends: 60 [2019-01-07 21:57:35,074 INFO L226 Difference]: Without dead ends: 58 [2019-01-07 21:57:35,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:57:35,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-07 21:57:35,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-07 21:57:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-07 21:57:35,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-07 21:57:35,078 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-07 21:57:35,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:35,078 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-07 21:57:35,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-07 21:57:35,078 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-07 21:57:35,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-07 21:57:35,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:35,079 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-07 21:57:35,079 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:35,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:35,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-07 21:57:35,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:35,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:35,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:35,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:36,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:36,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:36,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:36,333 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:36,333 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:36,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:36,333 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:36,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:36,342 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:36,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:36,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:36,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:36,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:39,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:39,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-07 21:57:39,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:39,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-07 21:57:39,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-07 21:57:39,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-07 21:57:39,833 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-07 21:57:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:39,929 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-07 21:57:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-07 21:57:39,930 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-07 21:57:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:39,931 INFO L225 Difference]: With dead ends: 61 [2019-01-07 21:57:39,931 INFO L226 Difference]: Without dead ends: 59 [2019-01-07 21:57:39,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-07 21:57:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-07 21:57:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-07 21:57:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-07 21:57:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-07 21:57:39,934 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-07 21:57:39,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:39,934 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-07 21:57:39,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-07 21:57:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-07 21:57:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-07 21:57:39,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:39,935 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-07 21:57:39,935 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:39,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:39,935 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-07 21:57:39,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:39,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:39,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:41,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:41,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:41,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:41,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:41,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:41,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:41,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:41,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:41,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:41,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:44,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:45,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:45,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-07 21:57:45,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:45,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-07 21:57:45,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-07 21:57:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:57:45,019 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-07 21:57:45,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:45,139 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-07 21:57:45,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-07 21:57:45,139 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-07 21:57:45,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:45,140 INFO L225 Difference]: With dead ends: 62 [2019-01-07 21:57:45,140 INFO L226 Difference]: Without dead ends: 60 [2019-01-07 21:57:45,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:57:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-07 21:57:45,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-07 21:57:45,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-07 21:57:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-07 21:57:45,143 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-07 21:57:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:45,143 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-07 21:57:45,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-07 21:57:45,143 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-07 21:57:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-07 21:57:45,144 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:45,144 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-07 21:57:45,144 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:45,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-07 21:57:45,145 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:45,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:45,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:45,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:46,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:46,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:46,336 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:46,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:46,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:46,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:46,345 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:57:46,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:57:46,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-07 21:57:46,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:46,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:46,623 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:50,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:50,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-07 21:57:50,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:50,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-07 21:57:50,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-07 21:57:50,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 21:57:50,473 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-07 21:57:50,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:50,554 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-07 21:57:50,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-07 21:57:50,555 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-07 21:57:50,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:50,556 INFO L225 Difference]: With dead ends: 63 [2019-01-07 21:57:50,556 INFO L226 Difference]: Without dead ends: 61 [2019-01-07 21:57:50,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 21:57:50,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-07 21:57:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-07 21:57:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-07 21:57:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-07 21:57:50,560 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-07 21:57:50,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:50,560 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-07 21:57:50,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-07 21:57:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-07 21:57:50,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-07 21:57:50,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:50,561 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-07 21:57:50,561 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:50,562 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-07 21:57:50,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:50,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:50,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:50,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:50,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:51,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:51,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:51,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:51,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:51,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:51,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:51,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:57:51,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:57:51,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:57:51,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:57:51,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:51,923 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:57:55,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:55,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:57:55,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-07 21:57:55,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:57:55,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-07 21:57:55,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-07 21:57:55,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 21:57:55,981 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-07 21:57:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:57:56,089 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-07 21:57:56,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-07 21:57:56,089 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-07 21:57:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:57:56,090 INFO L225 Difference]: With dead ends: 64 [2019-01-07 21:57:56,090 INFO L226 Difference]: Without dead ends: 62 [2019-01-07 21:57:56,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 21:57:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-07 21:57:56,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-07 21:57:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-07 21:57:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-07 21:57:56,093 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-07 21:57:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:57:56,093 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-07 21:57:56,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-07 21:57:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-07 21:57:56,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-07 21:57:56,094 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:57:56,094 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-07 21:57:56,094 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:57:56,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:57:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-07 21:57:56,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:57:56,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:56,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:57:56,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:57:56,096 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:57:56,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:57,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:57,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:57,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:57:57,433 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:57:57,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:57:57,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:57:57,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:57:57,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:57:57,444 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:57:57,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:57:57,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:57:57,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:57:57,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:01,358 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:01,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:01,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-07 21:58:01,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:01,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-07 21:58:01,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-07 21:58:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-07 21:58:01,380 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-07 21:58:01,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:01,476 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-07 21:58:01,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-07 21:58:01,476 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-07 21:58:01,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:01,477 INFO L225 Difference]: With dead ends: 65 [2019-01-07 21:58:01,477 INFO L226 Difference]: Without dead ends: 63 [2019-01-07 21:58:01,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-07 21:58:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-07 21:58:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-07 21:58:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-07 21:58:01,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-07 21:58:01,480 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-07 21:58:01,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:01,481 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-07 21:58:01,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-07 21:58:01,481 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-07 21:58:01,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-07 21:58:01,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:01,481 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-07 21:58:01,482 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:01,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:01,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-07 21:58:01,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:01,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:01,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:01,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:01,483 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:03,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:03,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:03,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:03,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:03,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:03,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:03,033 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:58:03,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:58:03,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-07 21:58:03,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:03,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:03,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:03,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:07,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:07,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:07,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-07 21:58:07,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:07,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-07 21:58:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-07 21:58:07,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:58:07,526 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-07 21:58:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:07,602 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-07 21:58:07,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 21:58:07,603 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-07 21:58:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:07,603 INFO L225 Difference]: With dead ends: 66 [2019-01-07 21:58:07,603 INFO L226 Difference]: Without dead ends: 64 [2019-01-07 21:58:07,604 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 [2019-01-07 21:58:07,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-07 21:58:07,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-07 21:58:07,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-07 21:58:07,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-07 21:58:07,607 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-07 21:58:07,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:07,607 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-07 21:58:07,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-07 21:58:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-07 21:58:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-07 21:58:07,608 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:07,608 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-07 21:58:07,608 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-07 21:58:07,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:07,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:07,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:09,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:09,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:09,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:09,380 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:09,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:09,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:09,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:09,390 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:58:09,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:58:09,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:58:09,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:09,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:09,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:09,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:13,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:13,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:13,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-07 21:58:13,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:13,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-07 21:58:13,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-07 21:58:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-07 21:58:13,563 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-07 21:58:13,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:13,677 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-07 21:58:13,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-07 21:58:13,678 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-07 21:58:13,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:13,678 INFO L225 Difference]: With dead ends: 67 [2019-01-07 21:58:13,678 INFO L226 Difference]: Without dead ends: 65 [2019-01-07 21:58:13,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-07 21:58:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-07 21:58:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-07 21:58:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-07 21:58:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-07 21:58:13,681 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-07 21:58:13,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:13,681 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-07 21:58:13,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-07 21:58:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-07 21:58:13,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-07 21:58:13,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:13,681 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-07 21:58:13,682 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:13,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:13,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-07 21:58:13,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:13,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:13,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:13,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:13,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:15,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:15,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:15,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:15,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:15,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:15,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:15,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:15,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:58:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:15,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:15,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:19,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:19,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-07 21:58:19,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:19,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-07 21:58:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-07 21:58:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 21:58:19,964 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-07 21:58:20,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:20,114 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-07 21:58:20,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-07 21:58:20,115 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-07 21:58:20,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:20,115 INFO L225 Difference]: With dead ends: 68 [2019-01-07 21:58:20,115 INFO L226 Difference]: Without dead ends: 66 [2019-01-07 21:58:20,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 21:58:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-07 21:58:20,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-07 21:58:20,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-07 21:58:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-07 21:58:20,118 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-07 21:58:20,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:20,118 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-07 21:58:20,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-07 21:58:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-07 21:58:20,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-07 21:58:20,119 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:20,119 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-07 21:58:20,119 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:20,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:20,119 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-07 21:58:20,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:20,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:20,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:20,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:21,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:21,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:21,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:21,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:21,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:21,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:21,737 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:21,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:58:21,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:58:22,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-07 21:58:22,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:22,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:22,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:26,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:26,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:26,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-07 21:58:26,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:26,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-07 21:58:26,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-07 21:58:26,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 21:58:26,623 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-07 21:58:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:26,746 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-07 21:58:26,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-07 21:58:26,746 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-07 21:58:26,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:26,747 INFO L225 Difference]: With dead ends: 69 [2019-01-07 21:58:26,747 INFO L226 Difference]: Without dead ends: 67 [2019-01-07 21:58:26,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 21:58:26,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-07 21:58:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-07 21:58:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-07 21:58:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-07 21:58:26,750 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-07 21:58:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:26,751 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-07 21:58:26,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-07 21:58:26,751 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-07 21:58:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-07 21:58:26,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:26,751 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-07 21:58:26,752 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:26,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-07 21:58:26,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:26,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:26,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:26,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:26,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:29,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:29,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:29,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:29,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:29,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:29,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:29,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:58:29,193 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:58:29,255 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:58:29,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:29,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:29,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:33,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:33,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-07 21:58:33,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:33,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-07 21:58:33,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-07 21:58:33,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 21:58:33,983 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-07 21:58:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:34,100 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-07 21:58:34,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-07 21:58:34,108 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-07 21:58:34,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:34,109 INFO L225 Difference]: With dead ends: 70 [2019-01-07 21:58:34,109 INFO L226 Difference]: Without dead ends: 68 [2019-01-07 21:58:34,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 21:58:34,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-07 21:58:34,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-07 21:58:34,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-07 21:58:34,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-07 21:58:34,113 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-07 21:58:34,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:34,113 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-07 21:58:34,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-07 21:58:34,114 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-07 21:58:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-07 21:58:34,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:34,114 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-07 21:58:34,114 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-07 21:58:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:34,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:34,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:34,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:34,117 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:35,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:35,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:35,927 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:35,927 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:35,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:35,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:35,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:35,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:58:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:35,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:36,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:40,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:40,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-07 21:58:40,856 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:40,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-07 21:58:40,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-07 21:58:40,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-07 21:58:40,858 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-07 21:58:40,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:40,949 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-07 21:58:40,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-07 21:58:40,949 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-07 21:58:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:40,950 INFO L225 Difference]: With dead ends: 71 [2019-01-07 21:58:40,950 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 21:58:40,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-07 21:58:40,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 21:58:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-07 21:58:40,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-07 21:58:40,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-07 21:58:40,954 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-07 21:58:40,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:40,954 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-07 21:58:40,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-07 21:58:40,955 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-07 21:58:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-07 21:58:40,955 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:40,955 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-07 21:58:40,955 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:40,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-07 21:58:40,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:40,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:40,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:40,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:40,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:43,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:43,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:43,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:43,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:43,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:43,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:43,506 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:58:43,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:58:44,016 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-07 21:58:44,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:44,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:44,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:44,040 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:49,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:49,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:49,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-07 21:58:49,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:49,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-07 21:58:49,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-07 21:58:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:58:49,279 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-07 21:58:49,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:49,383 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-07 21:58:49,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 21:58:49,383 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-07 21:58:49,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:49,384 INFO L225 Difference]: With dead ends: 72 [2019-01-07 21:58:49,384 INFO L226 Difference]: Without dead ends: 70 [2019-01-07 21:58:49,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:58:49,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-07 21:58:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-07 21:58:49,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-07 21:58:49,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-07 21:58:49,387 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-07 21:58:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:49,388 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-07 21:58:49,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-07 21:58:49,388 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-07 21:58:49,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-07 21:58:49,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:49,388 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-07 21:58:49,389 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:49,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:49,389 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-07 21:58:49,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:49,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:49,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:49,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:51,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:51,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:51,242 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:51,242 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:51,243 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:51,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:51,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:51,253 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:58:51,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:58:51,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:58:51,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:58:51,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:51,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:58:56,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:56,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:58:56,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-07 21:58:56,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:58:56,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-07 21:58:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-07 21:58:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-07 21:58:56,483 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-07 21:58:56,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:58:56,855 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-07 21:58:56,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-07 21:58:56,856 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-07 21:58:56,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:58:56,856 INFO L225 Difference]: With dead ends: 73 [2019-01-07 21:58:56,856 INFO L226 Difference]: Without dead ends: 71 [2019-01-07 21:58:56,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-07 21:58:56,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-07 21:58:56,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-07 21:58:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:58:56,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-07 21:58:56,860 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-07 21:58:56,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:58:56,860 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-07 21:58:56,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-07 21:58:56,860 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-07 21:58:56,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-07 21:58:56,861 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:58:56,861 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-07 21:58:56,861 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:58:56,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:58:56,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-07 21:58:56,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:58:56,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:56,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:58:56,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:58:56,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:58:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:58,615 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:58,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:58,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:58:58,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:58:58,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:58:58,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:58:58,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:58:58,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:58:58,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:58:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:58:58,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:58:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:58:58,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:03,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:03,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:03,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-07 21:59:03,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:03,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-07 21:59:03,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-07 21:59:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-07 21:59:03,826 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-07 21:59:03,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:03,924 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-07 21:59:03,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-07 21:59:03,924 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-07 21:59:03,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:03,925 INFO L225 Difference]: With dead ends: 74 [2019-01-07 21:59:03,925 INFO L226 Difference]: Without dead ends: 72 [2019-01-07 21:59:03,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-07 21:59:03,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-07 21:59:03,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-07 21:59:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-07 21:59:03,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-07 21:59:03,929 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-07 21:59:03,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:03,929 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-07 21:59:03,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-07 21:59:03,929 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-07 21:59:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-07 21:59:03,930 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:03,930 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-07 21:59:03,930 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:03,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:03,930 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-07 21:59:03,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:03,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:03,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:03,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:03,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:05,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:05,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:05,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:05,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:05,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:05,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:05,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:06,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:59:06,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:59:06,524 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-07 21:59:06,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:06,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:06,541 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:11,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:11,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:11,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-07 21:59:11,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:11,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-07 21:59:11,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-07 21:59:11,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:59:11,973 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-07 21:59:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:12,180 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-07 21:59:12,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-07 21:59:12,180 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-07 21:59:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:12,181 INFO L225 Difference]: With dead ends: 75 [2019-01-07 21:59:12,181 INFO L226 Difference]: Without dead ends: 73 [2019-01-07 21:59:12,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:59:12,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-07 21:59:12,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-07 21:59:12,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-07 21:59:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-07 21:59:12,184 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-07 21:59:12,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:12,184 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-07 21:59:12,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-07 21:59:12,184 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-07 21:59:12,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-07 21:59:12,184 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:12,184 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-07 21:59:12,185 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:12,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:12,185 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-07 21:59:12,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:12,185 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:12,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:12,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:13,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:13,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:13,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:13,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:13,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:13,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:13,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:59:13,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:59:14,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:59:14,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:14,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:14,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:19,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:19,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-07 21:59:19,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:19,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-07 21:59:19,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-07 21:59:19,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 21:59:19,436 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-07 21:59:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:19,602 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-07 21:59:19,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 21:59:19,603 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-07 21:59:19,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:19,603 INFO L225 Difference]: With dead ends: 76 [2019-01-07 21:59:19,603 INFO L226 Difference]: Without dead ends: 74 [2019-01-07 21:59:19,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 21:59:19,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-07 21:59:19,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-07 21:59:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-07 21:59:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-07 21:59:19,609 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-07 21:59:19,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:19,610 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-07 21:59:19,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-07 21:59:19,610 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-07 21:59:19,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-07 21:59:19,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:19,611 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-07 21:59:19,611 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:19,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:19,611 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-07 21:59:19,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:19,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:19,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:19,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:21,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:21,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:21,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:21,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:21,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:21,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:21,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:21,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:21,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:59:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:21,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:21,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:21,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:27,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:27,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:27,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-07 21:59:27,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:27,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-07 21:59:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-07 21:59:27,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-07 21:59:27,459 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-07 21:59:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:27,655 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-07 21:59:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-07 21:59:27,655 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-07 21:59:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:27,656 INFO L225 Difference]: With dead ends: 77 [2019-01-07 21:59:27,656 INFO L226 Difference]: Without dead ends: 75 [2019-01-07 21:59:27,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-07 21:59:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-07 21:59:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-07 21:59:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-07 21:59:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-07 21:59:27,660 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-07 21:59:27,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:27,661 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-07 21:59:27,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-07 21:59:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-07 21:59:27,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-07 21:59:27,661 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:27,662 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-07 21:59:27,662 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:27,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:27,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-07 21:59:27,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:27,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:27,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:27,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:29,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:29,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:29,512 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:29,512 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:29,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:29,512 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:29,521 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:59:29,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:59:30,124 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-07 21:59:30,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:30,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:30,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:30,148 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:35,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:35,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:35,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-07 21:59:35,871 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:35,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 21:59:35,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 21:59:35,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 21:59:35,873 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-07 21:59:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:36,019 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-07 21:59:36,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-07 21:59:36,019 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-07 21:59:36,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:36,020 INFO L225 Difference]: With dead ends: 78 [2019-01-07 21:59:36,020 INFO L226 Difference]: Without dead ends: 76 [2019-01-07 21:59:36,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 21:59:36,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-07 21:59:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-07 21:59:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-07 21:59:36,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-07 21:59:36,024 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-07 21:59:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:36,024 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-07 21:59:36,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 21:59:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-07 21:59:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-07 21:59:36,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:36,025 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-07 21:59:36,025 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-07 21:59:36,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:36,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:36,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:38,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:38,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:38,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:38,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:38,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:38,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:38,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:59:38,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:59:38,402 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:59:38,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:38,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:38,424 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:44,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:44,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-07 21:59:44,390 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:44,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-07 21:59:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-07 21:59:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-07 21:59:44,391 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-07 21:59:44,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:44,545 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-07 21:59:44,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-07 21:59:44,545 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-07 21:59:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:44,546 INFO L225 Difference]: With dead ends: 79 [2019-01-07 21:59:44,546 INFO L226 Difference]: Without dead ends: 77 [2019-01-07 21:59:44,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-07 21:59:44,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-07 21:59:44,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-07 21:59:44,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-07 21:59:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-07 21:59:44,549 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-07 21:59:44,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:44,549 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-07 21:59:44,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-07 21:59:44,550 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-07 21:59:44,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-07 21:59:44,550 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:44,550 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-07 21:59:44,550 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:44,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-07 21:59:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:44,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:59:44,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:44,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:44,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:46,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:46,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:46,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:46,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:46,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:46,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:46,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:46,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:59:46,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:46,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:46,832 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:59:52,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:52,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:59:52,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-07 21:59:52,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:59:52,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-07 21:59:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-07 21:59:52,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 21:59:52,946 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-07 21:59:53,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:59:53,095 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-07 21:59:53,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-07 21:59:53,096 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-07 21:59:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:59:53,096 INFO L225 Difference]: With dead ends: 80 [2019-01-07 21:59:53,096 INFO L226 Difference]: Without dead ends: 78 [2019-01-07 21:59:53,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 21:59:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-07 21:59:53,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-07 21:59:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-07 21:59:53,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-07 21:59:53,099 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-07 21:59:53,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:59:53,099 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-07 21:59:53,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-07 21:59:53,099 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-07 21:59:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-07 21:59:53,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:59:53,100 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-07 21:59:53,100 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 21:59:53,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:59:53,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-07 21:59:53,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:59:53,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:53,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:59:53,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:59:53,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:59:53,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:59:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:55,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:55,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:59:55,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:59:55,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:59:55,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:59:55,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:59:55,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:59:55,209 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:59:55,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-07 21:59:55,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:59:55,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:59:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:59:55,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-07 22:00:02,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:02,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-07 22:00:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-07 22:00:02,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 22:00:02,354 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-07 22:00:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:02,456 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-07 22:00:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-07 22:00:02,456 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-07 22:00:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:02,457 INFO L225 Difference]: With dead ends: 81 [2019-01-07 22:00:02,457 INFO L226 Difference]: Without dead ends: 79 [2019-01-07 22:00:02,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 22:00:02,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-07 22:00:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-07 22:00:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-07 22:00:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-07 22:00:02,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-07 22:00:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:02,461 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-07 22:00:02,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-07 22:00:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-07 22:00:02,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-07 22:00:02,462 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:02,462 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-07 22:00:02,462 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:02,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:02,462 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-07 22:00:02,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:02,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:02,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:02,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:02,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:04,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:04,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:04,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:04,533 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:04,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:04,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:04,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:04,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:00:04,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:00:04,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:00:04,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:04,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:04,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:12,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:12,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:12,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-07 22:00:12,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:12,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-07 22:00:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-07 22:00:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-07 22:00:12,269 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-07 22:00:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:12,467 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-07 22:00:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-07 22:00:12,467 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-07 22:00:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:12,468 INFO L225 Difference]: With dead ends: 82 [2019-01-07 22:00:12,468 INFO L226 Difference]: Without dead ends: 80 [2019-01-07 22:00:12,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-07 22:00:12,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-07 22:00:12,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-07 22:00:12,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-07 22:00:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-07 22:00:12,471 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-07 22:00:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:12,472 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-07 22:00:12,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-07 22:00:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-07 22:00:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-07 22:00:12,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:12,472 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-07 22:00:12,472 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:12,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-07 22:00:12,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:12,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:12,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:12,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:12,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:14,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:14,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:14,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:14,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:14,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:14,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:14,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:14,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:00:14,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:14,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:14,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:14,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:21,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:21,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:21,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-07 22:00:21,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:21,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-07 22:00:21,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-07 22:00:21,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 22:00:21,636 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-07 22:00:22,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:22,169 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-07 22:00:22,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-07 22:00:22,170 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-07 22:00:22,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:22,170 INFO L225 Difference]: With dead ends: 83 [2019-01-07 22:00:22,170 INFO L226 Difference]: Without dead ends: 81 [2019-01-07 22:00:22,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 22:00:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-07 22:00:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-07 22:00:22,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-07 22:00:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-07 22:00:22,174 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-07 22:00:22,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:22,174 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-07 22:00:22,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-07 22:00:22,174 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-07 22:00:22,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-07 22:00:22,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:22,175 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-07 22:00:22,175 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:22,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:22,176 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-07 22:00:22,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:22,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:22,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:22,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:22,177 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:22,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:24,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:24,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:24,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:24,751 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:24,751 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:24,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:24,751 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:24,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:00:24,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:00:25,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-07 22:00:25,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:25,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:25,609 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:25,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:32,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:32,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:32,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-07 22:00:32,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:32,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 22:00:32,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 22:00:32,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 22:00:32,407 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-07 22:00:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:32,998 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-07 22:00:32,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-07 22:00:32,999 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-07 22:00:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:32,999 INFO L225 Difference]: With dead ends: 84 [2019-01-07 22:00:32,999 INFO L226 Difference]: Without dead ends: 82 [2019-01-07 22:00:33,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 22:00:33,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-07 22:00:33,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-07 22:00:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-07 22:00:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-07 22:00:33,005 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-07 22:00:33,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:33,006 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-07 22:00:33,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 22:00:33,006 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-07 22:00:33,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-07 22:00:33,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:33,007 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-07 22:00:33,007 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:33,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:33,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-07 22:00:33,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:33,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:33,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:33,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:33,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:35,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:35,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:35,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:35,399 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:35,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:35,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:35,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:35,407 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:00:35,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:00:35,467 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:00:35,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:35,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:35,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:42,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-07 22:00:42,763 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:42,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-07 22:00:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-07 22:00:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 22:00:42,765 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-07 22:00:42,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:42,965 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-07 22:00:42,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-07 22:00:42,965 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-07 22:00:42,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:42,965 INFO L225 Difference]: With dead ends: 85 [2019-01-07 22:00:42,966 INFO L226 Difference]: Without dead ends: 83 [2019-01-07 22:00:42,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 22:00:42,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-07 22:00:42,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-07 22:00:42,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-07 22:00:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-07 22:00:42,970 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-07 22:00:42,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:42,970 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-07 22:00:42,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-07 22:00:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-07 22:00:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-07 22:00:42,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:42,971 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-07 22:00:42,971 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:42,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:42,972 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-07 22:00:42,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:42,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:00:42,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:42,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:42,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:45,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:45,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:45,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:45,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:45,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:45,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:45,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:45,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:00:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:45,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:45,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:00:52,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:52,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:00:52,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-07 22:00:52,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:00:52,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-07 22:00:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-07 22:00:52,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 22:00:52,751 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-07 22:00:52,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:00:52,874 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-07 22:00:52,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-07 22:00:52,874 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-07 22:00:52,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:00:52,875 INFO L225 Difference]: With dead ends: 86 [2019-01-07 22:00:52,875 INFO L226 Difference]: Without dead ends: 84 [2019-01-07 22:00:52,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 22:00:52,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-07 22:00:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-07 22:00:52,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-07 22:00:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-07 22:00:52,880 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-07 22:00:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:00:52,880 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-07 22:00:52,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-07 22:00:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-07 22:00:52,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-07 22:00:52,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:00:52,881 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-07 22:00:52,881 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:00:52,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:00:52,881 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-07 22:00:52,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:00:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:52,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:00:52,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:00:52,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:00:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:00:55,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:55,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:55,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:00:55,758 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:00:55,758 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:00:55,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:00:55,758 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:00:55,766 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:00:55,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:00:56,658 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-07 22:00:56,658 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:00:56,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:00:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:00:56,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:04,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:04,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:04,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-07 22:01:04,236 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:04,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-07 22:01:04,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-07 22:01:04,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 22:01:04,238 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-07 22:01:04,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:04,423 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-07 22:01:04,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-07 22:01:04,423 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-07 22:01:04,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:04,424 INFO L225 Difference]: With dead ends: 87 [2019-01-07 22:01:04,424 INFO L226 Difference]: Without dead ends: 85 [2019-01-07 22:01:04,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 22:01:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-07 22:01:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-07 22:01:04,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-07 22:01:04,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-07 22:01:04,427 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-07 22:01:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:04,427 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-07 22:01:04,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-07 22:01:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-07 22:01:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-07 22:01:04,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:04,428 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-07 22:01:04,428 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-07 22:01:04,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:04,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:04,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:04,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:04,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:06,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:06,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:06,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:06,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:06,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:06,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:06,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:06,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:01:06,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:01:06,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:01:06,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:06,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:06,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:14,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:14,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:14,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-07 22:01:14,485 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:14,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-07 22:01:14,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-07 22:01:14,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 22:01:14,487 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-07 22:01:14,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:14,673 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-07 22:01:14,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-07 22:01:14,673 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-07 22:01:14,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:14,673 INFO L225 Difference]: With dead ends: 88 [2019-01-07 22:01:14,674 INFO L226 Difference]: Without dead ends: 86 [2019-01-07 22:01:14,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 22:01:14,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-07 22:01:14,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-07 22:01:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-07 22:01:14,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-07 22:01:14,677 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-07 22:01:14,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:14,677 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-07 22:01:14,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-07 22:01:14,677 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-07 22:01:14,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-07 22:01:14,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:14,678 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-07 22:01:14,678 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:14,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:14,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-07 22:01:14,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:14,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:14,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:14,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:14,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:17,328 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:17,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:17,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:17,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:17,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:17,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:17,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:17,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:01:17,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:01:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:17,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:17,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:25,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:25,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-07 22:01:25,138 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:25,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-07 22:01:25,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-07 22:01:25,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 22:01:25,140 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-07 22:01:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:25,371 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-07 22:01:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-07 22:01:25,372 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-07 22:01:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:25,372 INFO L225 Difference]: With dead ends: 89 [2019-01-07 22:01:25,372 INFO L226 Difference]: Without dead ends: 87 [2019-01-07 22:01:25,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 22:01:25,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-07 22:01:25,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-07 22:01:25,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-07 22:01:25,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-07 22:01:25,376 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-07 22:01:25,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:25,376 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-07 22:01:25,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-07 22:01:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-07 22:01:25,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-07 22:01:25,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:25,376 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-07 22:01:25,376 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:25,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:25,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-07 22:01:25,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:25,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:25,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:01:25,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:25,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:27,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:27,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:27,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:27,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:27,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:27,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:27,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:27,992 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:01:27,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:01:29,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-07 22:01:29,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:29,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:29,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:36,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:36,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-07 22:01:36,905 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:36,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 22:01:36,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 22:01:36,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 22:01:36,907 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-07 22:01:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:37,055 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-07 22:01:37,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-07 22:01:37,055 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-07 22:01:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:37,055 INFO L225 Difference]: With dead ends: 90 [2019-01-07 22:01:37,056 INFO L226 Difference]: Without dead ends: 88 [2019-01-07 22:01:37,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 22:01:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-07 22:01:37,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-07 22:01:37,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-07 22:01:37,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-07 22:01:37,059 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-07 22:01:37,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:37,059 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-07 22:01:37,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 22:01:37,059 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-07 22:01:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-07 22:01:37,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:37,060 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-07 22:01:37,060 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-07 22:01:37,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:37,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:37,061 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:39,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:39,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:39,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:39,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:39,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:39,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:39,927 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:01:39,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:01:39,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:01:39,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:01:39,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:40,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:47,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:47,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-07 22:01:47,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:47,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-07 22:01:47,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-07 22:01:47,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-07 22:01:47,818 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-07 22:01:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:47,978 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-07 22:01:47,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-07 22:01:47,978 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-07 22:01:47,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:47,979 INFO L225 Difference]: With dead ends: 91 [2019-01-07 22:01:47,979 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 22:01:47,980 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 [2019-01-07 22:01:47,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 22:01:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-07 22:01:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-07 22:01:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-07 22:01:47,982 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-07 22:01:47,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:47,982 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-07 22:01:47,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-07 22:01:47,983 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-07 22:01:47,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-07 22:01:47,983 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:47,983 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-07 22:01:47,983 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:47,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:47,984 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-07 22:01:47,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:47,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:47,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:01:47,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:47,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:48,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:50,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:50,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:01:50,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:01:50,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:01:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:01:50,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:01:50,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:01:50,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:01:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:01:51,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:01:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:51,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:01:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:01:59,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:01:59,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-07 22:01:59,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:01:59,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-07 22:01:59,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-07 22:01:59,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 22:01:59,032 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-07 22:01:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:01:59,419 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-07 22:01:59,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-07 22:01:59,419 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-07 22:01:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:01:59,420 INFO L225 Difference]: With dead ends: 92 [2019-01-07 22:01:59,420 INFO L226 Difference]: Without dead ends: 90 [2019-01-07 22:01:59,421 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 [2019-01-07 22:01:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-07 22:01:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-07 22:01:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-07 22:01:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-07 22:01:59,423 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-07 22:01:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:01:59,424 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-07 22:01:59,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-07 22:01:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-07 22:01:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-07 22:01:59,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:01:59,424 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-07 22:01:59,425 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:01:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:01:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-07 22:01:59,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:01:59,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:59,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:01:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:01:59,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:01:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:02,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:02,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:02,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:02,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:02,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:02,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:02:02,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:02:03,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-07 22:02:03,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:02:03,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:03,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:12,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:12,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-07 22:02:12,295 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:12,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-07 22:02:12,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-07 22:02:12,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 22:02:12,297 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-07 22:02:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:12,514 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-07 22:02:12,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-07 22:02:12,514 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-07 22:02:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:12,515 INFO L225 Difference]: With dead ends: 93 [2019-01-07 22:02:12,515 INFO L226 Difference]: Without dead ends: 91 [2019-01-07 22:02:12,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 22:02:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-07 22:02:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-07 22:02:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 22:02:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-07 22:02:12,517 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-07 22:02:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:12,518 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-07 22:02:12,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-07 22:02:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-07 22:02:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-07 22:02:12,518 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:12,518 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-07 22:02:12,518 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:12,519 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-07 22:02:12,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:12,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:12,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:02:12,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:12,519 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:15,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:15,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:15,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:15,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:15,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:15,732 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:02:15,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:02:15,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:02:15,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:02:15,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:15,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:15,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:24,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:24,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:24,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-07 22:02:24,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:24,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-07 22:02:24,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-07 22:02:24,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 22:02:24,145 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-07 22:02:24,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:24,275 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-07 22:02:24,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-07 22:02:24,275 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-07 22:02:24,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:24,276 INFO L225 Difference]: With dead ends: 94 [2019-01-07 22:02:24,276 INFO L226 Difference]: Without dead ends: 92 [2019-01-07 22:02:24,277 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 [2019-01-07 22:02:24,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-07 22:02:24,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-07 22:02:24,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-07 22:02:24,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-07 22:02:24,280 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-07 22:02:24,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:24,280 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-07 22:02:24,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-07 22:02:24,281 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-07 22:02:24,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-07 22:02:24,281 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:24,281 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-07 22:02:24,281 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:24,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:24,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-07 22:02:24,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:24,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:02:24,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:24,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:27,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:27,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:27,354 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:27,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:27,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:27,354 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:02:27,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:02:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:27,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:27,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:27,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:36,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:36,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-07 22:02:36,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:36,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-07 22:02:36,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-07 22:02:36,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 22:02:36,394 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-07 22:02:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:36,612 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-07 22:02:36,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-07 22:02:36,612 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-07 22:02:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:36,613 INFO L225 Difference]: With dead ends: 95 [2019-01-07 22:02:36,613 INFO L226 Difference]: Without dead ends: 93 [2019-01-07 22:02:36,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 22:02:36,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-07 22:02:36,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-07 22:02:36,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-07 22:02:36,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-07 22:02:36,616 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-07 22:02:36,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:36,616 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-07 22:02:36,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-07 22:02:36,617 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-07 22:02:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-07 22:02:36,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:36,617 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-07 22:02:36,617 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-07 22:02:36,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:36,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:02:36,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:36,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:39,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:39,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:39,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:39,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:39,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:39,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:39,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:02:39,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:02:40,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-07 22:02:40,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:02:40,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:40,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:40,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:02:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:49,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:02:49,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-07 22:02:49,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:02:49,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 22:02:49,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 22:02:49,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 22:02:49,723 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-07 22:02:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:02:49,863 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-07 22:02:49,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-07 22:02:49,863 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-07 22:02:49,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:02:49,864 INFO L225 Difference]: With dead ends: 96 [2019-01-07 22:02:49,864 INFO L226 Difference]: Without dead ends: 94 [2019-01-07 22:02:49,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 22:02:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-07 22:02:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-07 22:02:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-07 22:02:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-07 22:02:49,868 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-07 22:02:49,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:02:49,868 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-07 22:02:49,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 22:02:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-07 22:02:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-07 22:02:49,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:02:49,868 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-07 22:02:49,869 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:02:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:02:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-07 22:02:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:02:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:49,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:02:49,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:02:49,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:02:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:02:53,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:53,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:53,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:02:53,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:02:53,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:02:53,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:02:53,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:02:53,237 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:02:53,238 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:02:53,294 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:02:53,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:02:53,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:02:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:02:53,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:02,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:02,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:02,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-07 22:03:02,562 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:02,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-07 22:03:02,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-07 22:03:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 22:03:02,564 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-07 22:03:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:02,810 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-07 22:03:02,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-07 22:03:02,811 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-07 22:03:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:02,811 INFO L225 Difference]: With dead ends: 97 [2019-01-07 22:03:02,812 INFO L226 Difference]: Without dead ends: 95 [2019-01-07 22:03:02,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 22:03:02,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-07 22:03:02,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-07 22:03:02,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-07 22:03:02,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-07 22:03:02,815 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-07 22:03:02,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:02,816 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-07 22:03:02,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-07 22:03:02,816 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-07 22:03:02,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-07 22:03:02,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:02,816 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-07 22:03:02,817 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:02,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:02,817 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-07 22:03:02,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:02,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:03:02,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:02,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:02,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:05,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:05,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:05,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:05,849 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:05,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:05,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:05,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:05,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:03:05,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:03:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:05,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:05,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:05,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:15,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:15,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-07 22:03:15,432 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:15,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-07 22:03:15,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-07 22:03:15,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 22:03:15,434 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-07 22:03:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:15,636 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-07 22:03:15,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-07 22:03:15,637 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-07 22:03:15,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:15,637 INFO L225 Difference]: With dead ends: 98 [2019-01-07 22:03:15,638 INFO L226 Difference]: Without dead ends: 96 [2019-01-07 22:03:15,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 22:03:15,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-07 22:03:15,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-07 22:03:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-07 22:03:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-07 22:03:15,641 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-07 22:03:15,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:15,641 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-07 22:03:15,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-07 22:03:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-07 22:03:15,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-07 22:03:15,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:15,642 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-07 22:03:15,642 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:15,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:15,642 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-07 22:03:15,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:15,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:03:15,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:15,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:19,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:19,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:19,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:19,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:19,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:19,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:19,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:19,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:03:19,235 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:03:20,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-07 22:03:20,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:03:20,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:20,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:30,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:30,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-07 22:03:30,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:30,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-07 22:03:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-07 22:03:30,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 22:03:30,436 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-07 22:03:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:30,604 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-07 22:03:30,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-07 22:03:30,605 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-07 22:03:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:30,606 INFO L225 Difference]: With dead ends: 99 [2019-01-07 22:03:30,606 INFO L226 Difference]: Without dead ends: 97 [2019-01-07 22:03:30,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 22:03:30,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-07 22:03:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-07 22:03:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-07 22:03:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-07 22:03:30,609 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-07 22:03:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:30,610 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-07 22:03:30,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-07 22:03:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-07 22:03:30,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-07 22:03:30,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:30,610 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-07 22:03:30,610 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:30,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:30,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-07 22:03:30,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:30,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:03:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:30,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:34,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:34,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:34,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:34,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:34,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:34,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:34,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:03:34,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:03:34,125 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:03:34,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:03:34,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:34,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:44,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:44,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-07 22:03:44,126 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:44,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-07 22:03:44,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-07 22:03:44,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 22:03:44,128 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-07 22:03:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:44,274 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-07 22:03:44,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-07 22:03:44,274 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-07 22:03:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:44,275 INFO L225 Difference]: With dead ends: 100 [2019-01-07 22:03:44,275 INFO L226 Difference]: Without dead ends: 98 [2019-01-07 22:03:44,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 22:03:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-07 22:03:44,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-07 22:03:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-07 22:03:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-07 22:03:44,278 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-07 22:03:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:44,278 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-07 22:03:44,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-07 22:03:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-07 22:03:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-07 22:03:44,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:44,279 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-07 22:03:44,279 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:44,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-07 22:03:44,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:44,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:03:44,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:44,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:47,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:47,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:47,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:03:47,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:03:47,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:03:47,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:03:47,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:03:47,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:03:47,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:03:47,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:03:47,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:03:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:47,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:03:57,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:03:57,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:03:57,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-07 22:03:57,797 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:03:57,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-07 22:03:57,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-07 22:03:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-07 22:03:57,799 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-07 22:03:57,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:03:57,979 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-07 22:03:57,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-07 22:03:57,979 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-07 22:03:57,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:03:57,980 INFO L225 Difference]: With dead ends: 101 [2019-01-07 22:03:57,980 INFO L226 Difference]: Without dead ends: 99 [2019-01-07 22:03:57,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-07 22:03:57,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-07 22:03:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-07 22:03:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-07 22:03:57,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-07 22:03:57,985 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-07 22:03:57,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:03:57,985 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-07 22:03:57,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-07 22:03:57,985 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-07 22:03:57,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-07 22:03:57,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:03:57,986 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-07 22:03:57,986 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:03:57,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:03:57,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-07 22:03:57,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:03:57,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:57,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:03:57,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:03:57,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:03:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:01,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:01,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:01,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:01,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:01,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:01,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:01,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:04:01,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:04:03,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-07 22:04:03,090 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:04:03,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:03,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:13,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:13,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-07 22:04:13,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:13,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-07 22:04:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-07 22:04:13,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 22:04:13,312 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-07 22:04:13,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:13,485 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-07 22:04:13,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-07 22:04:13,485 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-07 22:04:13,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:13,486 INFO L225 Difference]: With dead ends: 102 [2019-01-07 22:04:13,486 INFO L226 Difference]: Without dead ends: 100 [2019-01-07 22:04:13,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 22:04:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-07 22:04:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-07 22:04:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-07 22:04:13,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-07 22:04:13,490 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-07 22:04:13,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:13,490 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-07 22:04:13,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-07 22:04:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-07 22:04:13,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-07 22:04:13,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:13,491 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-07 22:04:13,491 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:13,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-07 22:04:13,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:13,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:04:13,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:13,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:16,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:16,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:16,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:16,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:16,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:16,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:16,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:04:16,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:04:16,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:04:16,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:04:16,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:16,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:16,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:27,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:27,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:27,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-07 22:04:27,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:27,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-07 22:04:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-07 22:04:27,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-07 22:04:27,217 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-07 22:04:27,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:27,435 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-07 22:04:27,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-07 22:04:27,436 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-07 22:04:27,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:27,437 INFO L225 Difference]: With dead ends: 103 [2019-01-07 22:04:27,437 INFO L226 Difference]: Without dead ends: 101 [2019-01-07 22:04:27,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-07 22:04:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-07 22:04:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-07 22:04:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-07 22:04:27,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-07 22:04:27,440 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-07 22:04:27,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:27,440 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-07 22:04:27,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-07 22:04:27,440 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-07 22:04:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-07 22:04:27,441 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:27,441 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-07 22:04:27,441 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:27,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:27,441 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-07 22:04:27,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:27,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:04:27,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:27,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:31,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:31,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:31,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:31,136 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:31,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:31,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:31,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:31,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:04:31,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:04:31,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:31,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:31,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:41,809 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:41,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:41,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-07 22:04:41,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:41,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-07 22:04:41,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-07 22:04:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-07 22:04:41,830 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-07 22:04:42,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:42,134 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-07 22:04:42,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-07 22:04:42,135 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-07 22:04:42,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:42,136 INFO L225 Difference]: With dead ends: 104 [2019-01-07 22:04:42,136 INFO L226 Difference]: Without dead ends: 102 [2019-01-07 22:04:42,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-07 22:04:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-07 22:04:42,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-07 22:04:42,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-07 22:04:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-07 22:04:42,140 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-07 22:04:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:42,140 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-07 22:04:42,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-07 22:04:42,140 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-07 22:04:42,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-07 22:04:42,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:42,141 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-07 22:04:42,141 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:42,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-07 22:04:42,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:42,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:42,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:04:42,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:42,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:04:45,892 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:45,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:45,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:04:45,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:04:45,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:04:45,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:04:45,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:04:45,902 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:04:45,902 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:04:47,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-07 22:04:47,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:04:47,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:04:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:47,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:04:58,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:04:58,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:04:58,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-07 22:04:58,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:04:58,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-07 22:04:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-07 22:04:58,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-07 22:04:58,726 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-07 22:04:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:04:59,031 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-07 22:04:59,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-07 22:04:59,031 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-07 22:04:59,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:04:59,032 INFO L225 Difference]: With dead ends: 105 [2019-01-07 22:04:59,032 INFO L226 Difference]: Without dead ends: 103 [2019-01-07 22:04:59,033 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 [2019-01-07 22:04:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-07 22:04:59,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-07 22:04:59,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-07 22:04:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-07 22:04:59,035 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-07 22:04:59,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:04:59,035 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-07 22:04:59,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-07 22:04:59,035 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-07 22:04:59,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-07 22:04:59,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:04:59,036 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-07 22:04:59,036 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:04:59,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:04:59,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-07 22:04:59,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:04:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:59,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:04:59,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:04:59,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:04:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:02,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:02,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:02,727 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:02,727 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:02,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:02,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:05:02,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:05:02,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:05:02,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:05:02,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:02,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:05:13,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:13,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:05:13,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-07 22:05:13,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:05:13,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-07 22:05:13,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-07 22:05:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-07 22:05:13,901 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-07 22:05:14,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:05:14,184 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-07 22:05:14,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-07 22:05:14,185 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-07 22:05:14,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:05:14,185 INFO L225 Difference]: With dead ends: 106 [2019-01-07 22:05:14,185 INFO L226 Difference]: Without dead ends: 104 [2019-01-07 22:05:14,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-07 22:05:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-07 22:05:14,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-07 22:05:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-07 22:05:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-07 22:05:14,189 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-07 22:05:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:05:14,189 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-07 22:05:14,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-07 22:05:14,190 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-07 22:05:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-07 22:05:14,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:05:14,190 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-07 22:05:14,191 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:05:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:05:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-07 22:05:14,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:05:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:14,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:05:14,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:14,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:05:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:18,096 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:18,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:18,096 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:18,096 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:18,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:18,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:18,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:18,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:05:18,104 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:05:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:18,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:18,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:05:29,375 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:29,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:05:29,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-07 22:05:29,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:05:29,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-07 22:05:29,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-07 22:05:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-07 22:05:29,397 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-07 22:05:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:05:29,603 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-07 22:05:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-07 22:05:29,603 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-07 22:05:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:05:29,604 INFO L225 Difference]: With dead ends: 107 [2019-01-07 22:05:29,604 INFO L226 Difference]: Without dead ends: 105 [2019-01-07 22:05:29,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-07 22:05:29,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-07 22:05:29,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-07 22:05:29,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-07 22:05:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-07 22:05:29,609 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-07 22:05:29,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:05:29,609 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-07 22:05:29,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-07 22:05:29,609 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-07 22:05:29,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-07 22:05:29,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:05:29,610 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-07 22:05:29,610 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:05:29,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:05:29,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-07 22:05:29,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:05:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:29,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:05:29,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:29,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:05:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:33,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:33,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:33,492 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:33,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:33,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:33,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:33,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:33,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:05:33,501 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:05:35,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-07 22:05:35,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:05:35,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:35,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:35,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:05:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:47,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:05:47,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-07 22:05:47,332 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:05:47,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-07 22:05:47,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-07 22:05:47,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-07 22:05:47,335 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-07 22:05:47,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:05:47,693 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-07 22:05:47,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-07 22:05:47,694 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-07 22:05:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:05:47,695 INFO L225 Difference]: With dead ends: 108 [2019-01-07 22:05:47,695 INFO L226 Difference]: Without dead ends: 106 [2019-01-07 22:05:47,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-07 22:05:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-07 22:05:47,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-07 22:05:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-07 22:05:47,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-07 22:05:47,700 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-07 22:05:47,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:05:47,700 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-07 22:05:47,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-07 22:05:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-07 22:05:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-07 22:05:47,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:05:47,701 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-07 22:05:47,701 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:05:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:05:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-07 22:05:47,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:05:47,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:47,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:05:47,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:05:47,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:05:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:05:51,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:51,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:51,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:05:51,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:05:51,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:05:51,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:05:51,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:05:51,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:05:51,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:05:51,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:05:51,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:05:51,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:05:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:05:51,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:03,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:03,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-07 22:06:03,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:03,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-07 22:06:03,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-07 22:06:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-07 22:06:03,567 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-07 22:06:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:03,865 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-07 22:06:03,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-07 22:06:03,865 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-07 22:06:03,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:03,866 INFO L225 Difference]: With dead ends: 109 [2019-01-07 22:06:03,866 INFO L226 Difference]: Without dead ends: 107 [2019-01-07 22:06:03,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-07 22:06:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-07 22:06:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-07 22:06:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-07 22:06:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-07 22:06:03,870 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-07 22:06:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:03,870 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-07 22:06:03,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-07 22:06:03,870 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-07 22:06:03,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-07 22:06:03,871 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:03,871 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-07 22:06:03,871 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:03,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:03,871 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-07 22:06:03,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:03,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:06:03,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:03,872 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:08,004 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:08,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:08,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:06:08,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:06:08,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:06:08,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:08,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:06:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:06:08,014 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:06:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:08,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:06:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:08,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:20,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:20,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-07 22:06:20,071 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:20,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-07 22:06:20,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-07 22:06:20,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-07 22:06:20,074 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-07 22:06:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:20,319 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-07 22:06:20,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-07 22:06:20,324 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-07 22:06:20,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:20,325 INFO L225 Difference]: With dead ends: 110 [2019-01-07 22:06:20,325 INFO L226 Difference]: Without dead ends: 108 [2019-01-07 22:06:20,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-07 22:06:20,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-07 22:06:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-07 22:06:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-07 22:06:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-07 22:06:20,329 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-07 22:06:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:20,329 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-07 22:06:20,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-07 22:06:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-07 22:06:20,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-07 22:06:20,330 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:20,330 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-07 22:06:20,330 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:20,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-07 22:06:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:20,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:06:20,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:20,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:24,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:24,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:24,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:06:24,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:06:24,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:06:24,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:24,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:06:24,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:06:24,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:06:27,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-07 22:06:27,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:06:27,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:06:27,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:27,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:39,295 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:39,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:39,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-07 22:06:39,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:39,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-07 22:06:39,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-07 22:06:39,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-07 22:06:39,320 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-07 22:06:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:39,565 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-07 22:06:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-07 22:06:39,566 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-07 22:06:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:39,566 INFO L225 Difference]: With dead ends: 111 [2019-01-07 22:06:39,566 INFO L226 Difference]: Without dead ends: 109 [2019-01-07 22:06:39,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-07 22:06:39,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-07 22:06:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-07 22:06:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-07 22:06:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-07 22:06:39,569 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-07 22:06:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:39,569 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-07 22:06:39,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-07 22:06:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-07 22:06:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-07 22:06:39,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:39,570 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-07 22:06:39,570 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:39,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:39,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-07 22:06:39,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:39,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:06:39,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:39,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:06:43,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:43,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:43,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:06:43,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:06:43,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:06:43,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:06:43,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:06:43,849 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:06:43,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:06:43,918 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:06:43,918 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:06:43,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:06:43,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:43,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:06:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:06:56,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:06:56,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-07 22:06:56,369 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:06:56,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-07 22:06:56,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-07 22:06:56,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-07 22:06:56,371 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-07 22:06:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:06:56,614 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-07 22:06:56,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-07 22:06:56,615 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-07 22:06:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:06:56,615 INFO L225 Difference]: With dead ends: 112 [2019-01-07 22:06:56,615 INFO L226 Difference]: Without dead ends: 110 [2019-01-07 22:06:56,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-07 22:06:56,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-07 22:06:56,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-07 22:06:56,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-07 22:06:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-07 22:06:56,619 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-07 22:06:56,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:06:56,619 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-07 22:06:56,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-07 22:06:56,619 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-07 22:06:56,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-07 22:06:56,620 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:06:56,620 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-07 22:06:56,620 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:06:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:06:56,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-07 22:06:56,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:06:56,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:56,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:06:56,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:06:56,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:06:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:00,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:00,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:07:00,904 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:07:00,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:07:00,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:00,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:07:00,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:07:00,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:07:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:00,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:07:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:01,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:07:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:14,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:07:14,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-07 22:07:14,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:07:14,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-07 22:07:14,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-07 22:07:14,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-07 22:07:14,020 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-07 22:07:14,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:07:14,302 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-07 22:07:14,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-07 22:07:14,302 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-07 22:07:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:07:14,302 INFO L225 Difference]: With dead ends: 113 [2019-01-07 22:07:14,302 INFO L226 Difference]: Without dead ends: 111 [2019-01-07 22:07:14,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-07 22:07:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-07 22:07:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-07 22:07:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-07 22:07:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-07 22:07:14,307 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-07 22:07:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:07:14,307 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-07 22:07:14,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-07 22:07:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-07 22:07:14,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-07 22:07:14,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:07:14,308 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-07 22:07:14,308 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:07:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:07:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-07 22:07:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:07:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:07:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:14,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:07:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:18,778 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:18,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:18,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:07:18,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:07:18,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:07:18,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:18,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:07:18,787 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 22:07:18,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 22:07:21,545 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-07 22:07:21,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:07:21,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:07:21,575 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:21,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:07:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:34,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:07:34,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-07 22:07:34,737 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:07:34,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-07 22:07:34,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-07 22:07:34,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-07 22:07:34,739 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-07 22:07:35,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:07:35,085 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-07 22:07:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-07 22:07:35,086 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-07 22:07:35,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:07:35,086 INFO L225 Difference]: With dead ends: 114 [2019-01-07 22:07:35,086 INFO L226 Difference]: Without dead ends: 112 [2019-01-07 22:07:35,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-07 22:07:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-07 22:07:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-07 22:07:35,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-07 22:07:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-07 22:07:35,090 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-07 22:07:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:07:35,090 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-07 22:07:35,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-07 22:07:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-07 22:07:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-07 22:07:35,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:07:35,091 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-07 22:07:35,091 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:07:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:07:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-07 22:07:35,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:07:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:35,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:07:35,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:35,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:07:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:39,642 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:39,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:39,642 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:07:39,642 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:07:39,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:07:39,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:39,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:07:39,651 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 22:07:39,651 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 22:07:39,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 22:07:39,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 22:07:39,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:07:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:39,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:07:52,742 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:52,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:07:52,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-07 22:07:52,762 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:07:52,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-07 22:07:52,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-07 22:07:52,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-07 22:07:52,765 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-07 22:07:53,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:07:53,038 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-07 22:07:53,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-07 22:07:53,038 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-07 22:07:53,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:07:53,039 INFO L225 Difference]: With dead ends: 115 [2019-01-07 22:07:53,039 INFO L226 Difference]: Without dead ends: 113 [2019-01-07 22:07:53,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-07 22:07:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-07 22:07:53,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-07 22:07:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-07 22:07:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-07 22:07:53,044 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-07 22:07:53,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:07:53,044 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-07 22:07:53,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-07 22:07:53,044 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-07 22:07:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-07 22:07:53,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:07:53,045 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-07 22:07:53,045 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:07:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:07:53,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-07 22:07:53,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:07:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:53,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 22:07:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:07:53,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:07:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:57,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:57,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 22:07:57,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 22:07:57,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 22:07:57,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 22:07:57,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 22:07:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:07:57,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 22:07:57,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 22:07:57,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 22:07:57,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:07:57,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 22:08:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 22:08:10,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 22:08:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-07 22:08:10,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 22:08:10,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-07 22:08:10,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-07 22:08:10,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-07 22:08:10,988 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-07 22:08:11,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 22:08:11,224 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-07 22:08:11,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-07 22:08:11,224 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-07 22:08:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 22:08:11,225 INFO L225 Difference]: With dead ends: 116 [2019-01-07 22:08:11,225 INFO L226 Difference]: Without dead ends: 114 [2019-01-07 22:08:11,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-07 22:08:11,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-07 22:08:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-07 22:08:11,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-07 22:08:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-07 22:08:11,230 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-07 22:08:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 22:08:11,230 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-07 22:08:11,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-07 22:08:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-07 22:08:11,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-07 22:08:11,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 22:08:11,231 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-07 22:08:11,231 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 22:08:11,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 22:08:11,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-07 22:08:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 22:08:11,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:11,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 22:08:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 22:08:11,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 22:08:11,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat