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/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:23:51,068 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:23:51,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:23:51,086 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:23:51,086 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:23:51,087 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:23:51,089 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:23:51,091 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:23:51,092 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:23:51,093 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:23:51,094 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:23:51,094 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:23:51,095 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:23:51,096 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:23:51,098 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:23:51,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:23:51,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:23:51,101 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:23:51,103 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:23:51,105 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:23:51,106 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:23:51,107 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:23:51,110 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:23:51,110 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:23:51,110 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:23:51,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:23:51,112 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:23:51,113 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:23:51,114 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:23:51,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:23:51,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:23:51,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:23:51,116 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:23:51,116 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:23:51,117 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:23:51,121 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:23:51,121 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-20 10:23:51,150 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:23:51,150 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:23:51,151 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:23:51,151 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:23:51,151 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:23:51,152 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:23:51,152 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:23:51,152 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:23:51,152 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:23:51,152 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-20 10:23:51,153 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-20 10:23:51,153 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:23:51,153 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:23:51,154 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:23:51,154 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:23:51,154 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:23:51,154 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:23:51,154 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:23:51,155 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:23:51,155 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:23:51,155 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:23:51,155 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:23:51,155 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:23:51,156 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:23:51,156 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:23:51,156 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:23:51,156 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:23:51,156 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:23:51,157 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:23:51,157 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:23:51,157 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:23:51,157 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:23:51,157 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:23:51,158 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:23:51,158 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:23:51,158 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:23:51,158 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:23:51,158 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:23:51,159 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:23:51,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:23:51,202 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:23:51,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:23:51,206 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:23:51,207 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:23:51,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl [2019-01-20 10:23:51,208 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2019-01-20 10:23:51,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:23:51,243 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:23:51,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:23:51,244 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:23:51,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,273 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:23:51,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:23:51,283 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:23:51,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,296 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,303 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/1) ... [2019-01-20 10:23:51,304 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:23:51,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:23:51,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:23:51,306 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:23:51,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (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-20 10:23:51,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:23:51,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:23:51,608 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:23:51,608 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-20 10:23:51,609 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51 BoogieIcfgContainer [2019-01-20 10:23:51,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:23:51,611 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:23:51,611 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:23:51,614 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:23:51,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:23:51" (1/2) ... [2019-01-20 10:23:51,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47af6f19 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:23:51, skipping insertion in model container [2019-01-20 10:23:51,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:23:51" (2/2) ... [2019-01-20 10:23:51,618 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2019-01-20 10:23:51,628 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:23:51,636 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-20 10:23:51,651 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-20 10:23:51,681 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:23:51,681 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:23:51,681 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:23:51,681 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:23:51,681 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:23:51,682 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:23:51,682 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:23:51,682 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:23:51,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-20 10:23:51,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:23:51,701 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:51,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:23:51,705 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:51,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:51,711 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-20 10:23:51,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:51,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:51,830 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-20 10:23:51,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:23:51,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:23:51,833 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:23:51,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:23:51,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:23:51,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:23:51,851 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-20 10:23:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:51,952 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-20 10:23:51,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:23:51,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:23:51,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:51,977 INFO L225 Difference]: With dead ends: 12 [2019-01-20 10:23:51,978 INFO L226 Difference]: Without dead ends: 7 [2019-01-20 10:23:51,985 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-20 10:23:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-20 10:23:52,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-20 10:23:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-20 10:23:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-20 10:23:52,017 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-20 10:23:52,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:52,018 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-20 10:23:52,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:23:52,018 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-20 10:23:52,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:23:52,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:52,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:23:52,019 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:52,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:52,020 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-20 10:23:52,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:52,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:52,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:52,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:52,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:23:52,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:52,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:52,191 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:23:52,195 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-20 10:23:52,332 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-20 10:23:52,333 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:23:54,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:23:54,915 INFO L272 AbstractInterpreter]: Visited 6 different actions 34 times. Merged at 2 different actions 14 times. Widened at 2 different actions 6 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:23:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:54,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:23:54,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:54,926 INFO 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-20 10:23:55,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:55,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:55,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:55,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:23:55,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:23:55,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:55,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-20 10:23:55,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:55,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:23:55,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:23:55,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:23:55,314 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-20 10:23:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:55,421 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-20 10:23:55,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:23:55,422 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-20 10:23:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:55,423 INFO L225 Difference]: With dead ends: 13 [2019-01-20 10:23:55,423 INFO L226 Difference]: Without dead ends: 9 [2019-01-20 10:23:55,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-20 10:23:55,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-20 10:23:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-20 10:23:55,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-20 10:23:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-20 10:23:55,430 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-20 10:23:55,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:55,430 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-20 10:23:55,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:23:55,430 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-20 10:23:55,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:23:55,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:55,433 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-20 10:23:55,433 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:55,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:55,434 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-20 10:23:55,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:55,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:55,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:55,436 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:55,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:55,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:23:55,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:55,549 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:55,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:55,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:55,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:23:55,565 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:55,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:55,589 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:23:55,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:55,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:23:55,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:56,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:23:56,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:56,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-20 10:23:56,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:56,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-20 10:23:56,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-20 10:23:56,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:23:56,088 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-20 10:23:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:56,215 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-20 10:23:56,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:23:56,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-20 10:23:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:56,216 INFO L225 Difference]: With dead ends: 16 [2019-01-20 10:23:56,216 INFO L226 Difference]: Without dead ends: 11 [2019-01-20 10:23:56,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:23:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-20 10:23:56,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-20 10:23:56,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-20 10:23:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-20 10:23:56,220 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-20 10:23:56,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:56,220 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-20 10:23:56,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-20 10:23:56,220 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-20 10:23:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:23:56,221 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:56,221 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-20 10:23:56,221 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:56,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-20 10:23:56,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:56,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:56,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:56,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:56,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 10:23:56,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:56,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:56,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:56,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:56,408 INFO 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-20 10:23:56,418 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:56,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:56,451 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:56,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:56,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:56,457 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 10:23:56,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-20 10:23:56,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:56,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-20 10:23:56,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:56,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:23:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:23:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:23:56,915 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-20 10:23:57,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:57,007 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-20 10:23:57,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:23:57,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-20 10:23:57,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:57,008 INFO L225 Difference]: With dead ends: 19 [2019-01-20 10:23:57,008 INFO L226 Difference]: Without dead ends: 13 [2019-01-20 10:23:57,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:23:57,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-20 10:23:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-20 10:23:57,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-20 10:23:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-20 10:23:57,012 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-20 10:23:57,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:57,012 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-20 10:23:57,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:23:57,012 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-20 10:23:57,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-20 10:23:57,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:57,013 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-20 10:23:57,013 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:57,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:57,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-20 10:23:57,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:57,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:57,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 10:23:57,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:57,158 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:57,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:57,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,158 INFO 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-20 10:23:57,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:57,170 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:57,186 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 10:23:57,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:57,330 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-20 10:23:57,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:57,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-20 10:23:57,351 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:57,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:23:57,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:23:57,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:23:57,352 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-20 10:23:57,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:57,476 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-20 10:23:57,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:23:57,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-20 10:23:57,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:57,478 INFO L225 Difference]: With dead ends: 22 [2019-01-20 10:23:57,478 INFO L226 Difference]: Without dead ends: 15 [2019-01-20 10:23:57,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:23:57,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-20 10:23:57,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-20 10:23:57,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-20 10:23:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-20 10:23:57,484 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-20 10:23:57,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:57,484 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-20 10:23:57,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:23:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-20 10:23:57,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-20 10:23:57,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:57,485 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-20 10:23:57,489 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-20 10:23:57,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:57,490 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:57,788 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 10:23:57,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:57,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:57,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:57,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:57,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 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-20 10:23:57,799 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:57,799 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:57,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:23:57,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:57,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 10:23:57,821 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-20 10:23:57,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:57,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-20 10:23:57,980 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:57,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:23:57,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:23:57,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:23:57,981 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-20 10:23:58,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:58,028 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-20 10:23:58,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:23:58,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-20 10:23:58,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:58,032 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:23:58,032 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:23:58,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:23:58,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:23:58,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 10:23:58,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:23:58,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-20 10:23:58,036 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-20 10:23:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:58,036 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-20 10:23:58,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:23:58,037 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-20 10:23:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-20 10:23:58,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:58,037 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-20 10:23:58,037 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:58,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:58,038 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-20 10:23:58,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:58,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:58,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,125 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 10:23:58,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:58,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:58,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:58,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,127 INFO 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-20 10:23:58,137 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:58,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:58,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:58,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:58,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 10:23:58,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-20 10:23:58,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:58,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-20 10:23:58,347 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:58,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:23:58,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:23:58,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:23:58,348 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-20 10:23:58,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:58,399 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-20 10:23:58,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:23:58,400 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-20 10:23:58,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:58,400 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:23:58,400 INFO L226 Difference]: Without dead ends: 19 [2019-01-20 10:23:58,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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-20 10:23:58,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-20 10:23:58,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-20 10:23:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-20 10:23:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-20 10:23:58,405 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-20 10:23:58,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:58,405 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-20 10:23:58,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:23:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-20 10:23:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-20 10:23:58,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:58,406 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-20 10:23:58,407 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:58,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:58,407 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-20 10:23:58,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:58,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:58,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-20 10:23:58,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:58,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:58,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:58,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:58,535 INFO 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-20 10:23:58,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:58,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:23:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:58,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:58,578 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-20 10:23:58,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-20 10:23:58,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:58,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-20 10:23:58,809 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:58,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:23:58,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:23:58,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:23:58,810 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-20 10:23:58,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:58,923 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-20 10:23:58,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:23:58,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-20 10:23:58,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:58,926 INFO L225 Difference]: With dead ends: 31 [2019-01-20 10:23:58,926 INFO L226 Difference]: Without dead ends: 21 [2019-01-20 10:23:58,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:23:58,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-20 10:23:58,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-20 10:23:58,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-20 10:23:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-20 10:23:58,930 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-20 10:23:58,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:58,930 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-20 10:23:58,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:23:58,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-20 10:23:58,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-20 10:23:58,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:58,931 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-20 10:23:58,931 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:58,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:58,932 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-20 10:23:58,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:58,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:23:58,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:58,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:59,065 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 10:23:59,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:59,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:59,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:59,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,066 INFO 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-20 10:23:59,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:23:59,084 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:23:59,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-20 10:23:59,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:59,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:59,126 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 10:23:59,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:59,331 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-20 10:23:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-20 10:23:59,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:59,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:23:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:23:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:23:59,355 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-20 10:23:59,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:23:59,580 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-20 10:23:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:23:59,580 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-20 10:23:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:23:59,581 INFO L225 Difference]: With dead ends: 34 [2019-01-20 10:23:59,581 INFO L226 Difference]: Without dead ends: 23 [2019-01-20 10:23:59,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:23:59,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-20 10:23:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-20 10:23:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:23:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-20 10:23:59,586 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-20 10:23:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:23:59,586 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-20 10:23:59,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:23:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-20 10:23:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-20 10:23:59,587 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:23:59,587 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-20 10:23:59,588 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:23:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:23:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-20 10:23:59,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:23:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:23:59,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:23:59,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:23:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:23:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-20 10:23:59,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:23:59,740 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:23:59,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:23:59,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:23:59,740 INFO 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-20 10:23:59,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:23:59,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:23:59,784 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:23:59,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:23:59,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:23:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-20 10:23:59,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:23:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-20 10:23:59,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:23:59,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-20 10:23:59,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:23:59,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:23:59,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:23:59,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:23:59,995 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-20 10:24:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:00,074 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-20 10:24:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:24:00,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-20 10:24:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:00,075 INFO L225 Difference]: With dead ends: 37 [2019-01-20 10:24:00,075 INFO L226 Difference]: Without dead ends: 25 [2019-01-20 10:24:00,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:24:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-20 10:24:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-20 10:24:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:24:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-20 10:24:00,080 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-20 10:24:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:00,080 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-20 10:24:00,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:24:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-20 10:24:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-20 10:24:00,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:00,082 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-20 10:24:00,082 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:00,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:00,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-20 10:24:00,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:00,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 10:24:00,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:00,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:00,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:00,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:00,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:00,206 INFO 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-20 10:24:00,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:00,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:00,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 10:24:00,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-20 10:24:00,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:00,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-20 10:24:00,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:00,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:24:00,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:24:00,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:24:00,668 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-20 10:24:00,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:00,721 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-20 10:24:00,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-20 10:24:00,723 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-20 10:24:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:00,724 INFO L225 Difference]: With dead ends: 40 [2019-01-20 10:24:00,724 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:24:00,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:24:00,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:24:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-20 10:24:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-20 10:24:00,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-20 10:24:00,729 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-20 10:24:00,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:00,729 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-20 10:24:00,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:24:00,729 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-20 10:24:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-20 10:24:00,730 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:00,730 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-20 10:24:00,730 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:00,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:00,730 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-20 10:24:00,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:00,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:00,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:01,156 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-20 10:24:01,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:01,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:01,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:01,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,157 INFO 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-20 10:24:01,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:01,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:01,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-20 10:24:01,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:01,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-20 10:24:01,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-20 10:24:01,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:01,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-20 10:24:01,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:01,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:24:01,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:24:01,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:24:01,514 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2019-01-20 10:24:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:01,578 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-20 10:24:01,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-20 10:24:01,578 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2019-01-20 10:24:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:01,579 INFO L225 Difference]: With dead ends: 43 [2019-01-20 10:24:01,579 INFO L226 Difference]: Without dead ends: 29 [2019-01-20 10:24:01,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-20 10:24:01,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-20 10:24:01,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-20 10:24:01,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:24:01,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-20 10:24:01,584 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-20 10:24:01,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:01,585 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-20 10:24:01,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:24:01,585 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-20 10:24:01,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-20 10:24:01,586 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:01,586 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-20 10:24:01,586 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:01,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:01,586 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-20 10:24:01,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:01,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:01,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:01,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:01,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:01,776 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 10:24:01,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:01,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:01,777 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:01,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:01,777 INFO 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-20 10:24:01,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:01,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:01,809 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:01,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:01,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:01,818 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 10:24:01,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:02,125 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-20 10:24:02,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:02,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-20 10:24:02,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:02,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-20 10:24:02,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-20 10:24:02,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-20 10:24:02,147 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-20 10:24:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:02,248 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-20 10:24:02,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-20 10:24:02,249 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-20 10:24:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:02,250 INFO L225 Difference]: With dead ends: 46 [2019-01-20 10:24:02,250 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:24:02,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 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-20 10:24:02,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:24:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 10:24:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:24:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-20 10:24:02,255 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-20 10:24:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:02,256 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-20 10:24:02,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-20 10:24:02,256 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-20 10:24:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-20 10:24:02,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:02,257 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-20 10:24:02,257 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:02,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:02,257 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-20 10:24:02,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:02,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-20 10:24:02,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:02,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:02,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:02,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:02,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:02,443 INFO 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-20 10:24:02,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:02,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:02,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-20 10:24:02,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:02,841 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-20 10:24:02,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:02,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-20 10:24:02,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:02,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-20 10:24:02,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-20 10:24:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:24:02,862 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-20 10:24:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:02,926 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-20 10:24:02,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-20 10:24:02,926 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-20 10:24:02,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:02,927 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:24:02,927 INFO L226 Difference]: Without dead ends: 33 [2019-01-20 10:24:02,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-20 10:24:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-20 10:24:02,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-20 10:24:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:24:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-20 10:24:02,933 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-20 10:24:02,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:02,934 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-20 10:24:02,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-20 10:24:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-20 10:24:02,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-20 10:24:02,935 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:02,935 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-20 10:24:02,935 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-20 10:24:02,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:02,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 10:24:03,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:03,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:03,100 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:03,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:03,100 INFO 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-20 10:24:03,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:03,110 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:03,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-20 10:24:03,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:03,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:03,167 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 10:24:03,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:03,565 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-20 10:24:03,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:03,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-20 10:24:03,585 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:03,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-20 10:24:03,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-20 10:24:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:24:03,586 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-20 10:24:03,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:03,655 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-20 10:24:03,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-20 10:24:03,656 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-20 10:24:03,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:03,657 INFO L225 Difference]: With dead ends: 52 [2019-01-20 10:24:03,657 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:24:03,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-20 10:24:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:24:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-20 10:24:03,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:24:03,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-20 10:24:03,661 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-20 10:24:03,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:03,661 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-20 10:24:03,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-20 10:24:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-20 10:24:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-20 10:24:03,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:03,662 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-20 10:24:03,662 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:03,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:03,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-20 10:24:03,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:03,664 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:03,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:03,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:04,401 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-20 10:24:04,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:04,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:04,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:04,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:04,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:04,402 INFO 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-20 10:24:04,414 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:04,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:04,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:04,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:04,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:04,446 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-20 10:24:04,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-20 10:24:04,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:04,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-20 10:24:04,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:04,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-20 10:24:04,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-20 10:24:04,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:04,835 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-20 10:24:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:04,964 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-20 10:24:04,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-20 10:24:04,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-20 10:24:04,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:04,966 INFO L225 Difference]: With dead ends: 55 [2019-01-20 10:24:04,966 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:24:04,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-20 10:24:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:24:04,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-20 10:24:04,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:24:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-20 10:24:04,972 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-20 10:24:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:04,972 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-20 10:24:04,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-20 10:24:04,972 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-20 10:24:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-20 10:24:04,973 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:04,973 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-20 10:24:04,973 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-20 10:24:04,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:04,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:04,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:04,974 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 10:24:05,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:05,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:05,662 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:05,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:05,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:05,662 INFO 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-20 10:24:05,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:05,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:05,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 10:24:05,716 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:06,824 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-20 10:24:06,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:06,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-20 10:24:06,845 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:06,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-20 10:24:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-20 10:24:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-20 10:24:06,846 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-20 10:24:06,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:06,906 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-20 10:24:06,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-20 10:24:06,907 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-20 10:24:06,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:06,908 INFO L225 Difference]: With dead ends: 58 [2019-01-20 10:24:06,908 INFO L226 Difference]: Without dead ends: 39 [2019-01-20 10:24:06,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 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-20 10:24:06,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-20 10:24:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-20 10:24:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:24:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-20 10:24:06,915 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-20 10:24:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:06,915 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-20 10:24:06,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-20 10:24:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-20 10:24:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-20 10:24:06,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:06,916 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-20 10:24:06,916 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:06,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:06,917 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-20 10:24:06,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:06,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:06,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:06,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:06,918 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-20 10:24:07,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:07,446 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:07,446 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:07,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:07,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:07,446 INFO 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-20 10:24:07,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:07,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:07,508 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-20 10:24:07,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:07,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:07,519 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-20 10:24:07,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:08,228 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-20 10:24:08,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:08,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-20 10:24:08,247 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:08,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-20 10:24:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-20 10:24:08,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:24:08,248 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-20 10:24:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:08,324 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-20 10:24:08,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-20 10:24:08,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-20 10:24:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:08,326 INFO L225 Difference]: With dead ends: 61 [2019-01-20 10:24:08,326 INFO L226 Difference]: Without dead ends: 41 [2019-01-20 10:24:08,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-20 10:24:08,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-20 10:24:08,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-20 10:24:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:24:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-20 10:24:08,332 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-20 10:24:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:08,332 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-20 10:24:08,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-20 10:24:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-20 10:24:08,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-20 10:24:08,333 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:08,333 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-20 10:24:08,334 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:08,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:08,334 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-20 10:24:08,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:08,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:08,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:08,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 10:24:09,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:09,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:09,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:09,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:09,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:09,022 INFO 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-20 10:24:09,033 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:09,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:09,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:09,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:09,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 10:24:09,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-20 10:24:09,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:09,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-20 10:24:09,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:09,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-20 10:24:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-20 10:24:09,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:24:09,506 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-20 10:24:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:09,732 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-20 10:24:09,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-20 10:24:09,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-20 10:24:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:09,732 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:24:09,733 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 10:24:09,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-20 10:24:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 10:24:09,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-20 10:24:09,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 10:24:09,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-20 10:24:09,738 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-20 10:24:09,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:09,738 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-20 10:24:09,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-20 10:24:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-20 10:24:09,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-20 10:24:09,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:09,739 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-20 10:24:09,739 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:09,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:09,740 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-20 10:24:09,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:09,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:09,740 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:09,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:09,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:10,177 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-20 10:24:10,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:10,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:10,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:10,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:10,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:10,178 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:24:10,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:10,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:10,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:10,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-20 10:24:10,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:10,693 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-20 10:24:10,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:10,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-20 10:24:10,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:10,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-20 10:24:10,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-20 10:24:10,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 10:24:10,714 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-20 10:24:10,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:10,780 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-20 10:24:10,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-20 10:24:10,781 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-20 10:24:10,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:10,782 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:24:10,782 INFO L226 Difference]: Without dead ends: 45 [2019-01-20 10:24:10,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-20 10:24:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-20 10:24:10,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-20 10:24:10,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-20 10:24:10,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-20 10:24:10,788 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-20 10:24:10,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:10,788 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-20 10:24:10,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-20 10:24:10,788 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-20 10:24:10,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-20 10:24:10,789 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:10,789 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-20 10:24:10,789 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:10,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:10,790 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-20 10:24:10,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:10,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:10,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:10,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:10,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 10:24:11,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:11,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:11,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:11,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:11,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:11,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 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-20 10:24:11,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:11,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:11,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-20 10:24:11,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:11,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 10:24:11,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-20 10:24:12,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:12,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-20 10:24:12,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:12,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-20 10:24:12,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-20 10:24:12,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:24:12,197 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-20 10:24:12,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:12,277 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-20 10:24:12,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-20 10:24:12,277 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-20 10:24:12,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:12,278 INFO L225 Difference]: With dead ends: 70 [2019-01-20 10:24:12,279 INFO L226 Difference]: Without dead ends: 47 [2019-01-20 10:24:12,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-20 10:24:12,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-20 10:24:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-20 10:24:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:24:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-20 10:24:12,284 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-20 10:24:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:12,284 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-20 10:24:12,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-20 10:24:12,284 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-20 10:24:12,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-20 10:24:12,285 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:12,285 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-20 10:24:12,285 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:12,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:12,286 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-20 10:24:12,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:12,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:12,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:12,288 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:12,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:12,614 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-20 10:24:12,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:12,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:12,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:12,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:12,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:12,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 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-20 10:24:12,624 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:12,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:12,661 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:12,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:12,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:12,670 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-20 10:24:12,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:13,203 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-20 10:24:13,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:13,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-20 10:24:13,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-20 10:24:13,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-20 10:24:13,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:24:13,224 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-20 10:24:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:13,330 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-20 10:24:13,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-20 10:24:13,331 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-20 10:24:13,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:13,332 INFO L225 Difference]: With dead ends: 73 [2019-01-20 10:24:13,333 INFO L226 Difference]: Without dead ends: 49 [2019-01-20 10:24:13,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-20 10:24:13,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-20 10:24:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-20 10:24:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-20 10:24:13,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-20 10:24:13,337 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-20 10:24:13,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:13,338 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-20 10:24:13,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-20 10:24:13,338 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-20 10:24:13,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-20 10:24:13,339 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:13,339 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-20 10:24:13,339 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:13,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:13,339 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-20 10:24:13,339 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:13,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:13,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:13,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:13,340 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:13,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:13,667 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 10:24:13,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:13,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:13,668 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:13,668 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:13,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:13,668 INFO 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-20 10:24:13,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:13,677 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:13,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:13,723 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 10:24:13,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-20 10:24:14,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:14,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-20 10:24:14,331 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:14,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-20 10:24:14,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-20 10:24:14,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 10:24:14,333 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-20 10:24:14,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:14,457 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-20 10:24:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-20 10:24:14,458 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-20 10:24:14,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:14,459 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:24:14,459 INFO L226 Difference]: Without dead ends: 51 [2019-01-20 10:24:14,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-20 10:24:14,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-20 10:24:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-20 10:24:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:24:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-20 10:24:14,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-20 10:24:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:14,464 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-20 10:24:14,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-20 10:24:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-20 10:24:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-20 10:24:14,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:14,465 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-20 10:24:14,465 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:14,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-20 10:24:14,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:14,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:14,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:14,852 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-20 10:24:14,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:14,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:14,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:14,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:14,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:14,853 INFO 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-20 10:24:14,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:14,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:14,944 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-20 10:24:14,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:14,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:14,952 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-20 10:24:14,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:15,595 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-20 10:24:15,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:15,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-20 10:24:15,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:15,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-20 10:24:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-20 10:24:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:24:15,622 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-20 10:24:15,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:15,707 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-20 10:24:15,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-20 10:24:15,708 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-20 10:24:15,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:15,709 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:24:15,709 INFO L226 Difference]: Without dead ends: 53 [2019-01-20 10:24:15,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-20 10:24:15,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-20 10:24:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-20 10:24:15,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-20 10:24:15,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-20 10:24:15,714 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-20 10:24:15,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:15,714 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-20 10:24:15,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-20 10:24:15,715 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-20 10:24:15,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-20 10:24:15,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:15,715 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-20 10:24:15,715 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:15,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:15,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-20 10:24:15,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:15,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:15,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:15,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:16,069 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 10:24:16,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:16,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:16,069 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:16,070 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:16,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:16,070 INFO 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-20 10:24:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:16,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:16,122 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:16,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:16,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:16,132 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 10:24:16,133 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-20 10:24:17,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:17,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-20 10:24:17,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:17,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-20 10:24:17,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-20 10:24:17,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:24:17,758 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-20 10:24:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:17,861 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-20 10:24:17,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-20 10:24:17,862 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-20 10:24:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:17,862 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:24:17,862 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:24:17,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-20 10:24:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:24:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-20 10:24:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-20 10:24:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-20 10:24:17,867 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-20 10:24:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:17,868 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-20 10:24:17,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-20 10:24:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-20 10:24:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-20 10:24:17,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:17,868 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-20 10:24:17,869 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:17,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-20 10:24:17,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:17,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:17,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:17,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:17,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:17,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:18,511 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-20 10:24:18,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:18,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:18,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:18,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:18,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:18,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 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-20 10:24:18,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:18,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:18,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-20 10:24:18,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:19,273 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-20 10:24:19,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:19,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-20 10:24:19,292 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:19,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-20 10:24:19,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-20 10:24:19,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 10:24:19,294 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-20 10:24:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:19,383 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-20 10:24:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-20 10:24:19,383 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-20 10:24:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:19,384 INFO L225 Difference]: With dead ends: 85 [2019-01-20 10:24:19,384 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:24:19,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-20 10:24:19,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:24:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-20 10:24:19,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-20 10:24:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-20 10:24:19,389 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-20 10:24:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:19,390 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-20 10:24:19,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-20 10:24:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-20 10:24:19,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-20 10:24:19,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:19,390 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-20 10:24:19,391 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:19,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:19,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-20 10:24:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:19,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:19,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:19,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:19,959 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 10:24:19,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:19,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:19,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:19,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:19,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:19,959 INFO 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-20 10:24:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:19,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:20,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-20 10:24:20,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:20,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 10:24:20,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-20 10:24:20,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:20,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-20 10:24:20,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:20,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-20 10:24:20,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-20 10:24:20,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 10:24:20,865 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-20 10:24:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:20,962 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-20 10:24:20,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-20 10:24:20,962 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-20 10:24:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:20,963 INFO L225 Difference]: With dead ends: 88 [2019-01-20 10:24:20,963 INFO L226 Difference]: Without dead ends: 59 [2019-01-20 10:24:20,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-20 10:24:20,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-20 10:24:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-20 10:24:20,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:24:20,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-20 10:24:20,967 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-20 10:24:20,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:20,968 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-20 10:24:20,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-20 10:24:20,968 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-20 10:24:20,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-20 10:24:20,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:20,969 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-20 10:24:20,969 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:20,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:20,969 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-20 10:24:20,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:20,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:20,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:20,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:20,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-20 10:24:21,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:21,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:21,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:21,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:21,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:21,733 INFO 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-20 10:24:21,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:21,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:21,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:21,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:21,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-20 10:24:21,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-20 10:24:22,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:22,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-20 10:24:22,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:22,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-20 10:24:22,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-20 10:24:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:24:22,642 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-20 10:24:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:22,785 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-20 10:24:22,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-20 10:24:22,785 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-20 10:24:22,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:22,786 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:24:22,786 INFO L226 Difference]: Without dead ends: 61 [2019-01-20 10:24:22,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-20 10:24:22,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-20 10:24:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-20 10:24:22,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:24:22,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-20 10:24:22,791 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-20 10:24:22,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:22,791 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-20 10:24:22,791 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-20 10:24:22,792 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-20 10:24:22,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-20 10:24:22,792 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:22,792 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-20 10:24:22,792 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:22,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:22,793 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-20 10:24:22,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:22,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:22,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:22,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:22,794 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:23,550 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 10:24:23,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:23,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:23,551 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:23,551 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:23,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:23,551 INFO 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-20 10:24:23,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:23,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:23,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 10:24:23,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-20 10:24:24,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:24,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-20 10:24:24,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:24,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-20 10:24:24,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-20 10:24:24,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 10:24:24,693 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-20 10:24:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:24,812 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-20 10:24:24,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-20 10:24:24,813 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-20 10:24:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:24,814 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:24:24,814 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:24:24,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-20 10:24:24,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:24:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-20 10:24:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 10:24:24,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-20 10:24:24,818 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-20 10:24:24,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:24,819 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-20 10:24:24,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-20 10:24:24,819 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-20 10:24:24,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-20 10:24:24,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:24,819 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-20 10:24:24,820 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:24,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:24,820 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-20 10:24:24,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:24,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:24,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:24,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:25,249 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-20 10:24:25,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:25,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:25,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:25,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:25,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:25,250 INFO 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-20 10:24:25,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:25,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:25,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-20 10:24:25,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:25,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-20 10:24:25,429 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:26,488 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-20 10:24:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:26,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-20 10:24:26,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:26,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-20 10:24:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-20 10:24:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:24:26,511 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-20 10:24:26,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:26,679 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-20 10:24:26,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-20 10:24:26,679 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-20 10:24:26,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:26,679 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:24:26,679 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:24:26,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-20 10:24:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:24:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-20 10:24:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-20 10:24:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-20 10:24:26,683 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-20 10:24:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:26,683 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-20 10:24:26,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-20 10:24:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-20 10:24:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-20 10:24:26,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:26,684 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-20 10:24:26,684 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:26,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:26,684 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-20 10:24:26,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:26,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:26,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:26,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:26,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:24:27,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:27,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:27,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:27,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:27,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:27,352 INFO 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-20 10:24:27,363 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:27,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:27,414 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:27,414 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:27,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:27,425 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:24:27,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-20 10:24:28,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:28,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-20 10:24:28,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:28,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-20 10:24:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-20 10:24:28,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:24:28,462 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-20 10:24:28,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:28,614 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-20 10:24:28,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-20 10:24:28,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-20 10:24:28,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:28,616 INFO L225 Difference]: With dead ends: 100 [2019-01-20 10:24:28,616 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:24:28,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-20 10:24:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:24:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-20 10:24:28,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:24:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-20 10:24:28,620 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-20 10:24:28,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:28,620 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-20 10:24:28,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-20 10:24:28,620 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-20 10:24:28,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-20 10:24:28,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:28,621 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-20 10:24:28,621 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:28,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:28,622 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-20 10:24:28,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:28,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:28,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:28,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:28,623 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:28,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-20 10:24:29,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:29,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:29,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:29,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:29,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:29,171 INFO 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-20 10:24:29,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:29,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:29,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:29,245 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-20 10:24:29,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-20 10:24:30,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:30,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-20 10:24:30,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:30,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-20 10:24:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-20 10:24:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 10:24:30,356 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-20 10:24:30,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:30,499 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-20 10:24:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-20 10:24:30,499 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-20 10:24:30,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:30,500 INFO L225 Difference]: With dead ends: 103 [2019-01-20 10:24:30,500 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:24:30,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-20 10:24:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:24:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-20 10:24:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:24:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-20 10:24:30,504 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-20 10:24:30,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:30,504 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-20 10:24:30,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-20 10:24:30,505 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-20 10:24:30,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-20 10:24:30,505 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:30,505 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-20 10:24:30,505 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:30,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:30,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-20 10:24:30,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:30,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:30,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:30,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:24:31,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:31,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:31,038 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:31,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:31,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:31,039 INFO 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-20 10:24:31,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:31,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:31,204 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-20 10:24:31,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:31,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:24:31,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-20 10:24:32,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:32,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-20 10:24:32,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:32,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-20 10:24:32,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-20 10:24:32,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 10:24:32,754 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-20 10:24:32,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:32,903 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-20 10:24:32,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-20 10:24:32,903 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-20 10:24:32,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:32,904 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:24:32,904 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:24:32,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-20 10:24:32,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:24:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-20 10:24:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:24:32,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-20 10:24:32,908 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-20 10:24:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:32,908 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-20 10:24:32,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-20 10:24:32,909 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-20 10:24:32,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-20 10:24:32,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:32,909 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-20 10:24:32,909 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:32,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-20 10:24:32,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:32,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:32,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:32,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:32,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-20 10:24:34,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:34,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:34,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:34,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:34,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:34,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 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-20 10:24:34,053 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:34,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:34,100 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:34,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:34,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-20 10:24:34,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-20 10:24:35,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-20 10:24:35,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:35,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-20 10:24:35,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-20 10:24:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:24:35,414 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-20 10:24:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:35,598 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-20 10:24:35,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-20 10:24:35,598 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-20 10:24:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:35,599 INFO L225 Difference]: With dead ends: 109 [2019-01-20 10:24:35,599 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:24:35,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-20 10:24:35,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:24:35,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-20 10:24:35,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:24:35,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-20 10:24:35,602 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-20 10:24:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-20 10:24:35,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-20 10:24:35,603 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-20 10:24:35,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-20 10:24:35,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:35,603 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-20 10:24:35,603 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:35,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-20 10:24:35,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:35,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:35,605 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:35,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:35,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:37,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:24:37,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:37,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:37,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:37,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:37,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:37,034 INFO 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-20 10:24:37,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:37,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:37,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:37,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:24:37,104 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:38,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-20 10:24:38,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:38,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-20 10:24:38,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:38,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-20 10:24:38,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-20 10:24:38,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 10:24:38,441 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-20 10:24:38,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:38,621 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-20 10:24:38,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-20 10:24:38,622 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-20 10:24:38,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:38,623 INFO L225 Difference]: With dead ends: 112 [2019-01-20 10:24:38,623 INFO L226 Difference]: Without dead ends: 75 [2019-01-20 10:24:38,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-20 10:24:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-20 10:24:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-20 10:24:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:24:38,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-20 10:24:38,627 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-20 10:24:38,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:38,627 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-20 10:24:38,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-20 10:24:38,627 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-20 10:24:38,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-20 10:24:38,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:38,628 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-20 10:24:38,628 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:38,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-20 10:24:38,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:38,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:38,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:38,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:38,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:39,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-20 10:24:39,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:39,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:39,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:39,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:39,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:39,241 INFO 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-20 10:24:39,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:39,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:39,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-20 10:24:39,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:39,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:39,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-20 10:24:39,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:40,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-20 10:24:40,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:40,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-20 10:24:40,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:40,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-20 10:24:40,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-20 10:24:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:24:40,977 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-20 10:24:41,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:41,116 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-20 10:24:41,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-20 10:24:41,116 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-20 10:24:41,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:41,117 INFO L225 Difference]: With dead ends: 115 [2019-01-20 10:24:41,117 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:24:41,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-20 10:24:41,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:24:41,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-20 10:24:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:24:41,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-20 10:24:41,121 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-20 10:24:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:41,121 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-20 10:24:41,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-20 10:24:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-20 10:24:41,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-20 10:24:41,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:41,122 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-20 10:24:41,122 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-20 10:24:41,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:41,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:41,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:41,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:41,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:24:41,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:41,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:41,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:41,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:41,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:41,814 INFO 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-20 10:24:41,823 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:41,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:41,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:41,888 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:41,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:24:41,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:43,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-20 10:24:43,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:43,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-20 10:24:43,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:43,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-20 10:24:43,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-20 10:24:43,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:24:43,561 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-20 10:24:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:43,715 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-20 10:24:43,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-20 10:24:43,716 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-20 10:24:43,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:43,717 INFO L225 Difference]: With dead ends: 118 [2019-01-20 10:24:43,717 INFO L226 Difference]: Without dead ends: 79 [2019-01-20 10:24:43,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-20 10:24:43,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-20 10:24:43,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-20 10:24:43,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:24:43,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-20 10:24:43,720 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-20 10:24:43,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:43,721 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-20 10:24:43,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-20 10:24:43,721 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-20 10:24:43,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-20 10:24:43,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:43,722 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-20 10:24:43,722 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:43,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:43,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-20 10:24:43,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:43,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:43,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:43,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-20 10:24:44,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:44,347 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:44,347 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:44,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:44,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:44,347 INFO 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-20 10:24:44,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:44,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:44,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:44,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-20 10:24:44,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-20 10:24:45,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:45,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-20 10:24:45,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:45,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-20 10:24:45,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-20 10:24:45,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:24:45,964 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-20 10:24:46,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:46,112 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-20 10:24:46,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-20 10:24:46,112 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-20 10:24:46,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:46,113 INFO L225 Difference]: With dead ends: 121 [2019-01-20 10:24:46,113 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:24:46,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-20 10:24:46,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:24:46,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-20 10:24:46,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-20 10:24:46,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-20 10:24:46,115 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-20 10:24:46,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:46,116 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-20 10:24:46,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-20 10:24:46,116 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-20 10:24:46,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-20 10:24:46,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:46,116 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-20 10:24:46,116 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:46,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:46,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-20 10:24:46,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:46,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:46,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:46,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:46,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:46,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:24:46,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:46,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:46,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:46,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:46,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:46,740 INFO 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-20 10:24:46,749 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:46,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:47,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-20 10:24:47,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:47,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:24:47,149 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-20 10:24:48,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:48,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-20 10:24:48,922 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:48,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-20 10:24:48,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-20 10:24:48,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:24:48,923 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-20 10:24:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:49,070 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-20 10:24:49,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-20 10:24:49,071 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-20 10:24:49,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:49,072 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:24:49,072 INFO L226 Difference]: Without dead ends: 83 [2019-01-20 10:24:49,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-20 10:24:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-20 10:24:49,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-20 10:24:49,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-20 10:24:49,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-20 10:24:49,076 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-20 10:24:49,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:49,076 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-20 10:24:49,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-20 10:24:49,076 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-20 10:24:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-20 10:24:49,077 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:49,077 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-20 10:24:49,077 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:49,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:49,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-20 10:24:49,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:49,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:49,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:49,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-20 10:24:49,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:49,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:49,840 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:49,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:49,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:49,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 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-20 10:24:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:24:49,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:24:49,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:24:49,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:49,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:49,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-20 10:24:49,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-20 10:24:51,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:51,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-20 10:24:51,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:51,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-20 10:24:51,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-20 10:24:51,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:24:51,687 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-20 10:24:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:51,847 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-20 10:24:51,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-20 10:24:51,848 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-20 10:24:51,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:51,849 INFO L225 Difference]: With dead ends: 127 [2019-01-20 10:24:51,849 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:24:51,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-20 10:24:51,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:24:51,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-20 10:24:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-20 10:24:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-20 10:24:51,853 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-20 10:24:51,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:51,853 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-20 10:24:51,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-20 10:24:51,853 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-20 10:24:51,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-20 10:24:51,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:51,854 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-20 10:24:51,854 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:51,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:51,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-20 10:24:51,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:51,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:51,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:51,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:52,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:24:52,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:52,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:52,785 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:52,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:52,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:52,786 INFO 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-20 10:24:52,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:52,794 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:24:52,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:52,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:52,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:24:52,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:54,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-20 10:24:54,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:54,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-20 10:24:54,774 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:54,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-20 10:24:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-20 10:24:54,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-20 10:24:54,775 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-20 10:24:54,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:54,955 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-20 10:24:54,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-20 10:24:54,956 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-20 10:24:54,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:54,956 INFO L225 Difference]: With dead ends: 130 [2019-01-20 10:24:54,956 INFO L226 Difference]: Without dead ends: 87 [2019-01-20 10:24:54,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 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-20 10:24:54,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-20 10:24:54,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-20 10:24:54,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-20 10:24:54,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-20 10:24:54,961 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-20 10:24:54,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:54,961 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-20 10:24:54,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-20 10:24:54,961 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-20 10:24:54,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-20 10:24:54,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:54,962 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-20 10:24:54,962 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:54,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:54,962 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-20 10:24:54,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:54,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:24:54,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:54,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:54,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:24:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-20 10:24:55,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:55,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:24:55,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:24:55,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:24:55,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:24:55,760 INFO 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-20 10:24:55,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:24:55,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:24:56,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-20 10:24:56,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:24:56,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:24:56,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-20 10:24:56,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:24:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-20 10:24:58,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:24:58,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-20 10:24:58,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:24:58,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-20 10:24:58,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-20 10:24:58,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:24:58,213 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-20 10:24:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:24:58,396 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-20 10:24:58,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-20 10:24:58,396 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-20 10:24:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:24:58,396 INFO L225 Difference]: With dead ends: 133 [2019-01-20 10:24:58,397 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:24:58,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-20 10:24:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:24:58,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-20 10:24:58,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:24:58,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-20 10:24:58,400 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-20 10:24:58,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:24:58,401 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-20 10:24:58,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-20 10:24:58,401 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-20 10:24:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-20 10:24:58,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:24:58,401 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-20 10:24:58,402 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:24:58,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:24:58,402 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-20 10:24:58,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:24:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:58,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:24:58,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:24:58,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:24:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:25:00,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:00,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:00,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:00,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:00,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:00,137 INFO 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-20 10:25:00,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:00,145 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:00,205 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:00,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:00,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:00,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:25:00,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-20 10:25:02,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:02,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-20 10:25:02,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:02,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-20 10:25:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-20 10:25:02,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:25:02,200 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-20 10:25:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:02,397 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-20 10:25:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-20 10:25:02,398 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-20 10:25:02,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:02,398 INFO L225 Difference]: With dead ends: 136 [2019-01-20 10:25:02,398 INFO L226 Difference]: Without dead ends: 91 [2019-01-20 10:25:02,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-20 10:25:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-20 10:25:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-20 10:25:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:25:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-20 10:25:02,402 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-20 10:25:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:02,402 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-20 10:25:02,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-20 10:25:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-20 10:25:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-20 10:25:02,403 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:02,403 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-20 10:25:02,403 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:02,403 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-20 10:25:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:02,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:02,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:02,404 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-20 10:25:03,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,448 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:03,448 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:03,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:03,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:03,448 INFO 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-20 10:25:03,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:03,457 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:03,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:03,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-20 10:25:03,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-20 10:25:05,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:05,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-20 10:25:05,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:05,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-20 10:25:05,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-20 10:25:05,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 10:25:05,657 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-20 10:25:05,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:05,958 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-20 10:25:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-20 10:25:05,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-20 10:25:05,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:05,960 INFO L225 Difference]: With dead ends: 139 [2019-01-20 10:25:05,960 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:25:05,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-20 10:25:05,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:25:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-20 10:25:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-20 10:25:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-20 10:25:05,964 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-20 10:25:05,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:05,964 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-20 10:25:05,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-20 10:25:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-20 10:25:05,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-20 10:25:05,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:05,965 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-20 10:25:05,965 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:05,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:05,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-20 10:25:05,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:05,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:05,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:05,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:07,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:25:07,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:07,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:07,098 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:07,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:07,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:07,098 INFO 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-20 10:25:07,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:07,107 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:07,482 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-20 10:25:07,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:07,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:07,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:25:07,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:09,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-20 10:25:09,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:09,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-20 10:25:09,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:09,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-20 10:25:09,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-20 10:25:09,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:25:09,868 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-20 10:25:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:11,209 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-20 10:25:11,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-20 10:25:11,209 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-20 10:25:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:11,210 INFO L225 Difference]: With dead ends: 142 [2019-01-20 10:25:11,210 INFO L226 Difference]: Without dead ends: 95 [2019-01-20 10:25:11,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-20 10:25:11,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-20 10:25:11,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-20 10:25:11,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-20 10:25:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-20 10:25:11,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-20 10:25:11,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:11,214 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-20 10:25:11,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-20 10:25:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-20 10:25:11,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-20 10:25:11,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:11,215 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-20 10:25:11,216 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:11,216 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-20 10:25:11,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:11,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:11,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:11,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:11,217 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:11,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:12,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-20 10:25:12,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:12,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:12,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:12,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:12,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:12,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:25:12,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:12,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:12,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:12,281 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:12,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:12,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-20 10:25:12,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-20 10:25:15,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:15,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-20 10:25:15,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:15,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-20 10:25:15,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-20 10:25:15,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:25:15,178 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-20 10:25:15,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:15,421 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-20 10:25:15,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-20 10:25:15,423 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-20 10:25:15,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:15,423 INFO L225 Difference]: With dead ends: 145 [2019-01-20 10:25:15,424 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:25:15,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-20 10:25:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:25:15,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-20 10:25:15,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-20 10:25:15,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-20 10:25:15,427 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-20 10:25:15,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:15,427 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-20 10:25:15,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-20 10:25:15,427 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-20 10:25:15,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-20 10:25:15,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:15,428 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-20 10:25:15,428 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:15,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-20 10:25:15,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:15,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:15,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:15,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:16,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:25:16,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:16,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:16,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:16,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:16,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:16,988 INFO 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-20 10:25:16,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:16,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:17,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:17,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:25:17,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-20 10:25:19,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:19,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-20 10:25:19,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:19,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-20 10:25:19,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-20 10:25:19,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 10:25:19,815 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-20 10:25:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:20,212 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-20 10:25:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-20 10:25:20,213 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-20 10:25:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:20,214 INFO L225 Difference]: With dead ends: 148 [2019-01-20 10:25:20,214 INFO L226 Difference]: Without dead ends: 99 [2019-01-20 10:25:20,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-20 10:25:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-20 10:25:20,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-20 10:25:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-20 10:25:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-20 10:25:20,217 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-20 10:25:20,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:20,217 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-20 10:25:20,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-20 10:25:20,217 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-20 10:25:20,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-20 10:25:20,218 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:20,218 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-20 10:25:20,218 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:20,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:20,218 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-20 10:25:20,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:20,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:20,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:20,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-20 10:25:21,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:21,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:21,210 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:21,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:21,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:21,210 INFO 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-20 10:25:21,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:21,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:21,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-20 10:25:21,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:21,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-20 10:25:21,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-20 10:25:24,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:24,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-20 10:25:24,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:24,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-20 10:25:24,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-20 10:25:24,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:25:24,707 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-20 10:25:24,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:24,901 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-20 10:25:24,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-20 10:25:24,902 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-20 10:25:24,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:24,902 INFO L225 Difference]: With dead ends: 151 [2019-01-20 10:25:24,902 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:25:24,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-20 10:25:24,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:25:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-20 10:25:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:25:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-20 10:25:24,906 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-20 10:25:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:24,907 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-20 10:25:24,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-20 10:25:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-20 10:25:24,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-20 10:25:24,907 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:24,907 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-20 10:25:24,907 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-20 10:25:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:24,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:24,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:24,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:25:25,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:25,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:25,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:25,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:25,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:25,906 INFO 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-20 10:25:25,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:25,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:25,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:25,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:25,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:25:25,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:28,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-20 10:25:28,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:28,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-20 10:25:28,736 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:28,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-20 10:25:28,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-20 10:25:28,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:25:28,738 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-20 10:25:28,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:28,977 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-20 10:25:28,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-20 10:25:28,979 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-20 10:25:28,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:28,980 INFO L225 Difference]: With dead ends: 154 [2019-01-20 10:25:28,980 INFO L226 Difference]: Without dead ends: 103 [2019-01-20 10:25:28,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-20 10:25:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-20 10:25:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-20 10:25:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-20 10:25:28,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-20 10:25:28,986 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-20 10:25:28,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:28,986 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-20 10:25:28,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-20 10:25:28,987 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-20 10:25:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-20 10:25:28,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:28,987 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-20 10:25:28,988 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-20 10:25:28,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:28,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:28,989 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:28,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:28,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:30,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-20 10:25:30,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:30,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:30,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:30,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:30,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:30,067 INFO 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-20 10:25:30,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:30,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:30,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-20 10:25:30,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:32,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-20 10:25:32,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:32,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-20 10:25:32,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:32,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-20 10:25:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-20 10:25:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:25:32,779 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-20 10:25:33,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:33,031 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-20 10:25:33,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-20 10:25:33,031 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-20 10:25:33,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:33,032 INFO L225 Difference]: With dead ends: 157 [2019-01-20 10:25:33,032 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:25:33,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-20 10:25:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:25:33,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-20 10:25:33,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-20 10:25:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-20 10:25:33,036 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-20 10:25:33,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:33,036 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-20 10:25:33,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-20 10:25:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-20 10:25:33,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-20 10:25:33,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:33,037 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-20 10:25:33,037 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:33,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:33,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-20 10:25:33,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:33,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:33,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:33,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:33,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:33,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:25:34,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:34,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:34,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:34,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:34,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:34,258 INFO 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-20 10:25:34,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:34,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:35,449 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-20 10:25:35,449 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:35,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:35,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:25:35,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:38,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-20 10:25:38,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:38,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-20 10:25:38,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:38,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-20 10:25:38,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-20 10:25:38,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 10:25:38,347 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-20 10:25:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:39,298 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-20 10:25:39,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-20 10:25:39,298 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-20 10:25:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:39,299 INFO L225 Difference]: With dead ends: 160 [2019-01-20 10:25:39,299 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:25:39,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-20 10:25:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:25:39,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-20 10:25:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-20 10:25:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-20 10:25:39,304 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-20 10:25:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:39,304 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-20 10:25:39,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-20 10:25:39,304 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-20 10:25:39,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-20 10:25:39,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:39,305 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-20 10:25:39,305 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:39,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:39,305 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-20 10:25:39,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:39,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:39,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:39,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:39,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:40,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-20 10:25:40,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:40,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:40,386 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:40,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:40,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:40,387 INFO 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-20 10:25:40,395 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:40,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:40,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:40,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:40,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:40,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-20 10:25:40,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:43,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-20 10:25:43,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:43,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-20 10:25:43,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:43,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-20 10:25:43,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-20 10:25:43,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:25:43,282 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-20 10:25:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:43,609 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-20 10:25:43,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-20 10:25:43,609 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-20 10:25:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:43,610 INFO L225 Difference]: With dead ends: 163 [2019-01-20 10:25:43,610 INFO L226 Difference]: Without dead ends: 109 [2019-01-20 10:25:43,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-20 10:25:43,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-20 10:25:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-20 10:25:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-20 10:25:43,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-20 10:25:43,614 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-20 10:25:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:43,615 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-20 10:25:43,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-20 10:25:43,615 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-20 10:25:43,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-20 10:25:43,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:43,616 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-20 10:25:43,616 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:43,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:43,616 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-20 10:25:43,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:43,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:43,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:43,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:43,617 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:45,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 10:25:45,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:45,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:45,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:45,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:45,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:45,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:25:45,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:45,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:25:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:45,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:45,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 10:25:45,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-20 10:25:48,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:48,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-20 10:25:48,057 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:48,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-20 10:25:48,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-20 10:25:48,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 10:25:48,058 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-20 10:25:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:48,314 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-20 10:25:48,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-20 10:25:48,315 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-20 10:25:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:48,316 INFO L225 Difference]: With dead ends: 166 [2019-01-20 10:25:48,316 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:25:48,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-20 10:25:48,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:25:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-20 10:25:48,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:25:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-20 10:25:48,319 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-20 10:25:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:48,319 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-20 10:25:48,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-20 10:25:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-20 10:25:48,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-20 10:25:48,320 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:48,320 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-20 10:25:48,320 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:48,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:48,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-20 10:25:48,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:48,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:48,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:25:48,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:48,321 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:49,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-20 10:25:49,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:49,711 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:49,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:49,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:49,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:49,712 INFO 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-20 10:25:49,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:25:49,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:25:50,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-20 10:25:50,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:50,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-20 10:25:50,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:54,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-20 10:25:54,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:54,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-20 10:25:54,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:54,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-20 10:25:54,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-20 10:25:54,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:25:54,223 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2019-01-20 10:25:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:54,504 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2019-01-20 10:25:54,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-20 10:25:54,505 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2019-01-20 10:25:54,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:54,505 INFO L225 Difference]: With dead ends: 169 [2019-01-20 10:25:54,505 INFO L226 Difference]: Without dead ends: 113 [2019-01-20 10:25:54,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-20 10:25:54,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-20 10:25:54,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-20 10:25:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 10:25:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-20 10:25:54,509 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2019-01-20 10:25:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:54,509 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-20 10:25:54,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-20 10:25:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-20 10:25:54,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-20 10:25:54,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:54,510 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-20 10:25:54,510 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2019-01-20 10:25:54,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:54,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:54,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:54,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:25:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-20 10:25:55,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:55,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:25:55,850 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:25:55,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:25:55,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:25:55,851 INFO 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-20 10:25:55,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:25:55,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:25:55,939 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:25:55,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:25:55,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:25:55,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-20 10:25:55,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:25:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2019-01-20 10:25:59,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:25:59,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-20 10:25:59,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:25:59,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-20 10:25:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-20 10:25:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:25:59,281 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2019-01-20 10:25:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:25:59,505 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2019-01-20 10:25:59,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-20 10:25:59,505 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2019-01-20 10:25:59,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:25:59,506 INFO L225 Difference]: With dead ends: 172 [2019-01-20 10:25:59,506 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 10:25:59,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-20 10:25:59,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 10:25:59,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-20 10:25:59,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-20 10:25:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2019-01-20 10:25:59,510 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2019-01-20 10:25:59,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:25:59,511 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2019-01-20 10:25:59,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-20 10:25:59,511 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2019-01-20 10:25:59,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-20 10:25:59,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:25:59,512 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2019-01-20 10:25:59,512 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:25:59,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:25:59,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2019-01-20 10:25:59,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:25:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:59,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:25:59,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:25:59,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:25:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:00,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-20 10:26:00,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:00,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:00,748 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:00,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:00,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:00,748 INFO 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-20 10:26:00,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:00,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:00,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:00,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-20 10:26:00,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-20 10:26:04,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:04,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-20 10:26:04,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:04,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-20 10:26:04,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-20 10:26:04,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-20 10:26:04,649 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2019-01-20 10:26:05,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:05,044 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2019-01-20 10:26:05,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-20 10:26:05,044 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2019-01-20 10:26:05,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:05,045 INFO L225 Difference]: With dead ends: 175 [2019-01-20 10:26:05,045 INFO L226 Difference]: Without dead ends: 117 [2019-01-20 10:26:05,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 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-20 10:26:05,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-20 10:26:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2019-01-20 10:26:05,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 10:26:05,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2019-01-20 10:26:05,049 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2019-01-20 10:26:05,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:05,049 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2019-01-20 10:26:05,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-20 10:26:05,049 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2019-01-20 10:26:05,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-20 10:26:05,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:05,050 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2019-01-20 10:26:05,050 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:05,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:05,051 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2019-01-20 10:26:05,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:05,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:05,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:05,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:05,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-20 10:26:06,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:06,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:06,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:06,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:06,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:06,278 INFO 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-20 10:26:06,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:06,287 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:07,117 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-20 10:26:07,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:07,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-20 10:26:07,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:11,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2019-01-20 10:26:11,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:11,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-20 10:26:11,056 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:11,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-20 10:26:11,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-20 10:26:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 10:26:11,058 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2019-01-20 10:26:11,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:11,426 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2019-01-20 10:26:11,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-20 10:26:11,427 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2019-01-20 10:26:11,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:11,427 INFO L225 Difference]: With dead ends: 178 [2019-01-20 10:26:11,427 INFO L226 Difference]: Without dead ends: 119 [2019-01-20 10:26:11,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-20 10:26:11,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-20 10:26:11,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2019-01-20 10:26:11,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-20 10:26:11,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2019-01-20 10:26:11,431 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2019-01-20 10:26:11,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:11,431 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2019-01-20 10:26:11,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-20 10:26:11,431 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2019-01-20 10:26:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-01-20 10:26:11,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:11,432 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2019-01-20 10:26:11,432 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2019-01-20 10:26:11,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:11,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:11,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:11,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:11,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-20 10:26:12,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:12,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:12,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:12,782 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:12,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:12,782 INFO 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-20 10:26:12,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:12,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:12,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:12,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:12,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-20 10:26:12,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:16,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2019-01-20 10:26:16,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:16,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-20 10:26:16,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:16,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-20 10:26:16,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-20 10:26:16,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-20 10:26:16,902 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2019-01-20 10:26:17,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:17,206 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2019-01-20 10:26:17,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-20 10:26:17,206 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2019-01-20 10:26:17,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:17,207 INFO L225 Difference]: With dead ends: 181 [2019-01-20 10:26:17,207 INFO L226 Difference]: Without dead ends: 121 [2019-01-20 10:26:17,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 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-20 10:26:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-20 10:26:17,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2019-01-20 10:26:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 10:26:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2019-01-20 10:26:17,211 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2019-01-20 10:26:17,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:17,211 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2019-01-20 10:26:17,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-20 10:26:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2019-01-20 10:26:17,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-20 10:26:17,212 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:17,212 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2019-01-20 10:26:17,212 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:17,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:17,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2019-01-20 10:26:17,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:17,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:17,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:17,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:17,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:18,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-20 10:26:18,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:18,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:18,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:18,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:18,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:18,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 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-20 10:26:18,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:18,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:18,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:18,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-20 10:26:18,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:22,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2019-01-20 10:26:22,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:22,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-20 10:26:22,503 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:22,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-20 10:26:22,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-20 10:26:22,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 10:26:22,505 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2019-01-20 10:26:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:22,902 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2019-01-20 10:26:22,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-20 10:26:22,902 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2019-01-20 10:26:22,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:22,903 INFO L225 Difference]: With dead ends: 184 [2019-01-20 10:26:22,903 INFO L226 Difference]: Without dead ends: 123 [2019-01-20 10:26:22,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-20 10:26:22,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-20 10:26:22,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2019-01-20 10:26:22,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-20 10:26:22,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2019-01-20 10:26:22,907 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2019-01-20 10:26:22,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:22,907 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2019-01-20 10:26:22,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-20 10:26:22,907 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2019-01-20 10:26:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-01-20 10:26:22,908 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:22,908 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2019-01-20 10:26:22,908 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2019-01-20 10:26:22,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:22,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:22,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:22,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:22,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:24,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-20 10:26:24,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:24,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:24,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:24,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:24,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:24,722 INFO 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-20 10:26:24,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:24,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:25,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-20 10:26:25,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:25,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-20 10:26:25,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:29,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2019-01-20 10:26:29,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:29,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-20 10:26:29,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:29,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-20 10:26:29,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-20 10:26:29,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:26:29,793 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2019-01-20 10:26:30,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:30,166 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2019-01-20 10:26:30,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-20 10:26:30,166 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2019-01-20 10:26:30,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:30,167 INFO L225 Difference]: With dead ends: 187 [2019-01-20 10:26:30,167 INFO L226 Difference]: Without dead ends: 125 [2019-01-20 10:26:30,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-20 10:26:30,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-01-20 10:26:30,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2019-01-20 10:26:30,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-20 10:26:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2019-01-20 10:26:30,171 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2019-01-20 10:26:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:30,171 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2019-01-20 10:26:30,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-20 10:26:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2019-01-20 10:26:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-20 10:26:30,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:30,172 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2019-01-20 10:26:30,172 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2019-01-20 10:26:30,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:30,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:30,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:30,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:30,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:31,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-20 10:26:31,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:31,650 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:31,650 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:31,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:31,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:31,650 INFO 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-20 10:26:31,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:31,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:31,744 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:31,744 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:31,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:31,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-20 10:26:31,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:35,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2019-01-20 10:26:35,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:35,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-20 10:26:35,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:35,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-20 10:26:35,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-20 10:26:35,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:26:35,866 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2019-01-20 10:26:36,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:36,187 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2019-01-20 10:26:36,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-20 10:26:36,187 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2019-01-20 10:26:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:36,188 INFO L225 Difference]: With dead ends: 190 [2019-01-20 10:26:36,189 INFO L226 Difference]: Without dead ends: 127 [2019-01-20 10:26:36,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-20 10:26:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-20 10:26:36,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-20 10:26:36,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-20 10:26:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2019-01-20 10:26:36,194 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2019-01-20 10:26:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:36,194 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2019-01-20 10:26:36,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-20 10:26:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2019-01-20 10:26:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-01-20 10:26:36,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:36,195 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2019-01-20 10:26:36,195 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:36,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:36,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2019-01-20 10:26:36,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:36,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:36,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:36,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:36,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-20 10:26:37,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:37,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:37,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:37,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:37,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:37,622 INFO 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-20 10:26:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:37,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:37,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:37,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-20 10:26:37,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:41,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2019-01-20 10:26:41,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:41,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-20 10:26:41,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:41,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-20 10:26:41,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-20 10:26:41,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:26:41,936 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2019-01-20 10:26:42,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:42,328 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2019-01-20 10:26:42,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-20 10:26:42,329 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2019-01-20 10:26:42,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:42,329 INFO L225 Difference]: With dead ends: 193 [2019-01-20 10:26:42,330 INFO L226 Difference]: Without dead ends: 129 [2019-01-20 10:26:42,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-20 10:26:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-20 10:26:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-01-20 10:26:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-20 10:26:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2019-01-20 10:26:42,334 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2019-01-20 10:26:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:42,334 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2019-01-20 10:26:42,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-20 10:26:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2019-01-20 10:26:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-20 10:26:42,334 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:42,334 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2019-01-20 10:26:42,335 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2019-01-20 10:26:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:42,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:42,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:42,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:42,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-20 10:26:43,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:43,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:43,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:43,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:43,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:43,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:26:43,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:26:43,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:26:44,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-20 10:26:44,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:44,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:44,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-20 10:26:44,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2019-01-20 10:26:49,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:49,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-20 10:26:49,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:49,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-20 10:26:49,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-20 10:26:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:26:49,080 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2019-01-20 10:26:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:49,487 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2019-01-20 10:26:49,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-20 10:26:49,487 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2019-01-20 10:26:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:49,488 INFO L225 Difference]: With dead ends: 196 [2019-01-20 10:26:49,488 INFO L226 Difference]: Without dead ends: 131 [2019-01-20 10:26:49,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-20 10:26:49,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-20 10:26:49,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-01-20 10:26:49,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-20 10:26:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2019-01-20 10:26:49,491 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2019-01-20 10:26:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:49,492 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2019-01-20 10:26:49,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-20 10:26:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2019-01-20 10:26:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-20 10:26:49,492 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:49,492 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2019-01-20 10:26:49,492 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:49,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:49,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2019-01-20 10:26:49,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:49,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:49,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:49,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:51,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-20 10:26:51,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:51,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:51,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:51,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:51,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:51,254 INFO 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-20 10:26:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:26:51,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:26:51,362 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:26:51,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:26:51,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-20 10:26:51,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:26:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2019-01-20 10:26:55,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:26:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-20 10:26:55,909 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:26:55,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-20 10:26:55,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-20 10:26:55,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:26:55,912 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2019-01-20 10:26:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:26:56,343 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2019-01-20 10:26:56,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-20 10:26:56,343 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2019-01-20 10:26:56,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:26:56,344 INFO L225 Difference]: With dead ends: 199 [2019-01-20 10:26:56,344 INFO L226 Difference]: Without dead ends: 133 [2019-01-20 10:26:56,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-20 10:26:56,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-20 10:26:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-01-20 10:26:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 10:26:56,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2019-01-20 10:26:56,348 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2019-01-20 10:26:56,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:26:56,349 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2019-01-20 10:26:56,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-20 10:26:56,349 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2019-01-20 10:26:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-01-20 10:26:56,350 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:26:56,350 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2019-01-20 10:26:56,350 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:26:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:26:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2019-01-20 10:26:56,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:26:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:56,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:26:56,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:26:56,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:26:56,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:58,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-20 10:26:58,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:58,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:26:58,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:26:58,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:26:58,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:26:58,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 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-20 10:26:58,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:26:58,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:26:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:26:58,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:26:58,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-20 10:26:58,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:02,834 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2019-01-20 10:27:02,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:02,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-20 10:27:02,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:02,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-20 10:27:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-20 10:27:02,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:27:02,856 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2019-01-20 10:27:03,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:03,335 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2019-01-20 10:27:03,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-20 10:27:03,335 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2019-01-20 10:27:03,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:03,336 INFO L225 Difference]: With dead ends: 202 [2019-01-20 10:27:03,336 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 10:27:03,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-20 10:27:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 10:27:03,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2019-01-20 10:27:03,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-20 10:27:03,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2019-01-20 10:27:03,340 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2019-01-20 10:27:03,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:03,340 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2019-01-20 10:27:03,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-20 10:27:03,341 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2019-01-20 10:27:03,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-01-20 10:27:03,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:03,342 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2019-01-20 10:27:03,342 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:03,342 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2019-01-20 10:27:03,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:03,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:03,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:03,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:04,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-20 10:27:04,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:04,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:04,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:04,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:04,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:04,964 INFO 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-20 10:27:04,974 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:04,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:08,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-20 10:27:08,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:08,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:08,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-20 10:27:08,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2019-01-20 10:27:13,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:13,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-20 10:27:13,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:13,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-20 10:27:13,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-20 10:27:13,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:27:13,978 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2019-01-20 10:27:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:14,361 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2019-01-20 10:27:14,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-20 10:27:14,361 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2019-01-20 10:27:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:14,362 INFO L225 Difference]: With dead ends: 205 [2019-01-20 10:27:14,362 INFO L226 Difference]: Without dead ends: 137 [2019-01-20 10:27:14,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-20 10:27:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-20 10:27:14,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-01-20 10:27:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 10:27:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2019-01-20 10:27:14,366 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2019-01-20 10:27:14,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:14,367 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2019-01-20 10:27:14,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-20 10:27:14,367 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2019-01-20 10:27:14,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-20 10:27:14,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:14,368 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2019-01-20 10:27:14,368 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2019-01-20 10:27:14,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:14,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:14,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:14,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-20 10:27:16,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:16,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:16,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:16,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:16,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:16,880 INFO 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-20 10:27:16,891 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:16,891 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:16,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:16,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:16,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-20 10:27:17,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-01-20 10:27:21,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:21,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-20 10:27:21,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:21,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-20 10:27:21,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-20 10:27:21,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:27:21,952 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2019-01-20 10:27:22,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:22,485 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2019-01-20 10:27:22,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-20 10:27:22,486 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2019-01-20 10:27:22,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:22,486 INFO L225 Difference]: With dead ends: 208 [2019-01-20 10:27:22,486 INFO L226 Difference]: Without dead ends: 139 [2019-01-20 10:27:22,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-20 10:27:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-20 10:27:22,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2019-01-20 10:27:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-20 10:27:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2019-01-20 10:27:22,490 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2019-01-20 10:27:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:22,490 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2019-01-20 10:27:22,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-20 10:27:22,490 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2019-01-20 10:27:22,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-01-20 10:27:22,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:22,491 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2019-01-20 10:27:22,491 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:22,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:22,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2019-01-20 10:27:22,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:22,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:22,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:22,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:22,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-20 10:27:24,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:24,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:24,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:24,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:24,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:24,212 INFO 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-20 10:27:24,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:24,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:24,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-20 10:27:24,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:29,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2019-01-20 10:27:29,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:29,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-20 10:27:29,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:29,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-20 10:27:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-20 10:27:29,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:27:29,110 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2019-01-20 10:27:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:29,641 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2019-01-20 10:27:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-20 10:27:29,641 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2019-01-20 10:27:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:29,642 INFO L225 Difference]: With dead ends: 211 [2019-01-20 10:27:29,642 INFO L226 Difference]: Without dead ends: 141 [2019-01-20 10:27:29,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-20 10:27:29,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-20 10:27:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-01-20 10:27:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-20 10:27:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2019-01-20 10:27:29,646 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2019-01-20 10:27:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2019-01-20 10:27:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-20 10:27:29,646 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2019-01-20 10:27:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-20 10:27:29,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:29,647 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2019-01-20 10:27:29,647 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:29,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2019-01-20 10:27:29,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:29,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:29,648 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:29,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:31,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-20 10:27:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:31,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:31,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:31,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:31,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:31,662 INFO 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-20 10:27:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:31,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:27:34,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-20 10:27:34,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:34,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-20 10:27:35,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:40,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2019-01-20 10:27:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-20 10:27:40,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:40,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-20 10:27:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-20 10:27:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:27:40,083 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2019-01-20 10:27:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:40,643 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2019-01-20 10:27:40,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-20 10:27:40,643 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2019-01-20 10:27:40,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:40,644 INFO L225 Difference]: With dead ends: 214 [2019-01-20 10:27:40,644 INFO L226 Difference]: Without dead ends: 143 [2019-01-20 10:27:40,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-20 10:27:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-01-20 10:27:40,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2019-01-20 10:27:40,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-01-20 10:27:40,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2019-01-20 10:27:40,647 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2019-01-20 10:27:40,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:40,648 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2019-01-20 10:27:40,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-20 10:27:40,648 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2019-01-20 10:27:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-01-20 10:27:40,648 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:40,648 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2019-01-20 10:27:40,649 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:40,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:40,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2019-01-20 10:27:40,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:40,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:40,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:40,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:40,650 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-20 10:27:42,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:42,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:42,700 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:42,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:42,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:42,700 INFO 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-20 10:27:42,709 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:27:42,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:27:42,807 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:27:42,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:27:42,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-20 10:27:42,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:48,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2019-01-20 10:27:48,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:48,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-20 10:27:48,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:48,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-20 10:27:48,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-20 10:27:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:27:48,183 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2019-01-20 10:27:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:48,725 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2019-01-20 10:27:48,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-20 10:27:48,726 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2019-01-20 10:27:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:48,726 INFO L225 Difference]: With dead ends: 217 [2019-01-20 10:27:48,727 INFO L226 Difference]: Without dead ends: 145 [2019-01-20 10:27:48,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-20 10:27:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-20 10:27:48,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-01-20 10:27:48,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-20 10:27:48,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2019-01-20 10:27:48,731 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2019-01-20 10:27:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:48,731 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2019-01-20 10:27:48,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-20 10:27:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2019-01-20 10:27:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-01-20 10:27:48,732 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:48,732 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2019-01-20 10:27:48,733 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:48,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:48,733 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2019-01-20 10:27:48,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:48,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:48,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:27:48,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:48,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-20 10:27:50,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:50,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:50,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:50,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:50,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:50,617 INFO 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-20 10:27:50,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:50,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:27:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:50,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:27:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-20 10:27:50,745 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:27:56,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2019-01-20 10:27:56,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:27:56,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-20 10:27:56,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:27:56,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-20 10:27:56,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-20 10:27:56,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:27:56,124 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2019-01-20 10:27:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:27:56,599 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2019-01-20 10:27:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-20 10:27:56,599 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2019-01-20 10:27:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:27:56,600 INFO L225 Difference]: With dead ends: 220 [2019-01-20 10:27:56,600 INFO L226 Difference]: Without dead ends: 147 [2019-01-20 10:27:56,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-20 10:27:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-01-20 10:27:56,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2019-01-20 10:27:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-20 10:27:56,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2019-01-20 10:27:56,604 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2019-01-20 10:27:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:27:56,604 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2019-01-20 10:27:56,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-20 10:27:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2019-01-20 10:27:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-20 10:27:56,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:27:56,605 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2019-01-20 10:27:56,605 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:27:56,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:27:56,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2019-01-20 10:27:56,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:27:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:56,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:27:56,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:27:56,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:27:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:27:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-20 10:27:58,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:58,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:27:58,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:27:58,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:27:58,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:27:58,719 INFO 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-20 10:27:58,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:27:58,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:01,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-20 10:28:01,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:01,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:01,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-20 10:28:01,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:06,684 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2019-01-20 10:28:06,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:06,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-20 10:28:06,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:06,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-20 10:28:06,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-20 10:28:06,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:28:06,710 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2019-01-20 10:28:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:07,346 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2019-01-20 10:28:07,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-20 10:28:07,346 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2019-01-20 10:28:07,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:07,347 INFO L225 Difference]: With dead ends: 223 [2019-01-20 10:28:07,347 INFO L226 Difference]: Without dead ends: 149 [2019-01-20 10:28:07,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-20 10:28:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-20 10:28:07,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-01-20 10:28:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-01-20 10:28:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2019-01-20 10:28:07,351 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2019-01-20 10:28:07,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:07,352 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2019-01-20 10:28:07,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-20 10:28:07,352 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2019-01-20 10:28:07,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-20 10:28:07,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:07,353 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2019-01-20 10:28:07,353 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:07,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:07,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2019-01-20 10:28:07,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:07,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:07,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:07,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:09,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-20 10:28:09,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:09,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:09,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:09,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:09,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:09,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 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-20 10:28:09,288 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:09,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:09,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:09,391 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:09,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:09,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-20 10:28:09,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2019-01-20 10:28:15,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:15,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-20 10:28:15,112 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:15,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-20 10:28:15,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-20 10:28:15,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:28:15,114 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2019-01-20 10:28:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:15,672 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2019-01-20 10:28:15,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-20 10:28:15,672 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2019-01-20 10:28:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:15,673 INFO L225 Difference]: With dead ends: 226 [2019-01-20 10:28:15,673 INFO L226 Difference]: Without dead ends: 151 [2019-01-20 10:28:15,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-20 10:28:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-20 10:28:15,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2019-01-20 10:28:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-20 10:28:15,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2019-01-20 10:28:15,678 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2019-01-20 10:28:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:15,678 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2019-01-20 10:28:15,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-20 10:28:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2019-01-20 10:28:15,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-20 10:28:15,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:15,680 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2019-01-20 10:28:15,680 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:15,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:15,680 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2019-01-20 10:28:15,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:15,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:15,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:15,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-20 10:28:18,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:18,123 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:18,123 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:18,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:18,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:18,124 INFO 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-20 10:28:18,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:18,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:18,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-20 10:28:18,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:24,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2019-01-20 10:28:24,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:24,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-20 10:28:24,146 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:24,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-20 10:28:24,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-20 10:28:24,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-20 10:28:24,148 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2019-01-20 10:28:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:24,709 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2019-01-20 10:28:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-20 10:28:24,710 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2019-01-20 10:28:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:24,710 INFO L225 Difference]: With dead ends: 229 [2019-01-20 10:28:24,711 INFO L226 Difference]: Without dead ends: 153 [2019-01-20 10:28:24,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 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-20 10:28:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-20 10:28:24,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-01-20 10:28:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-01-20 10:28:24,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2019-01-20 10:28:24,715 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2019-01-20 10:28:24,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:24,715 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2019-01-20 10:28:24,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-20 10:28:24,716 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2019-01-20 10:28:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-20 10:28:24,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:24,716 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2019-01-20 10:28:24,716 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:24,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:24,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2019-01-20 10:28:24,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:24,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:24,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:24,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:24,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-20 10:28:26,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:26,859 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:26,859 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:26,859 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:26,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:26,860 INFO 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-20 10:28:26,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:26,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:28:29,024 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-20 10:28:29,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:29,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:29,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-20 10:28:29,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:35,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2019-01-20 10:28:35,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:35,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-20 10:28:35,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:35,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-20 10:28:35,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-20 10:28:35,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:28:35,142 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2019-01-20 10:28:35,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:35,781 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2019-01-20 10:28:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-20 10:28:35,781 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2019-01-20 10:28:35,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:35,782 INFO L225 Difference]: With dead ends: 232 [2019-01-20 10:28:35,782 INFO L226 Difference]: Without dead ends: 155 [2019-01-20 10:28:35,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-20 10:28:35,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-01-20 10:28:35,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-01-20 10:28:35,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-01-20 10:28:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2019-01-20 10:28:35,786 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2019-01-20 10:28:35,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:35,786 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2019-01-20 10:28:35,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-20 10:28:35,786 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2019-01-20 10:28:35,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-20 10:28:35,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:35,787 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2019-01-20 10:28:35,787 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:35,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2019-01-20 10:28:35,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:35,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:35,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:35,788 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-20 10:28:38,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:38,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:38,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:38,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:38,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:38,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:28:38,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:28:38,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:28:38,754 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:28:38,754 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:28:38,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-20 10:28:38,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2019-01-20 10:28:44,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:44,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-20 10:28:44,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:44,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-20 10:28:44,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-20 10:28:44,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:28:44,930 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2019-01-20 10:28:45,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:45,683 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2019-01-20 10:28:45,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-20 10:28:45,683 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2019-01-20 10:28:45,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:45,684 INFO L225 Difference]: With dead ends: 235 [2019-01-20 10:28:45,684 INFO L226 Difference]: Without dead ends: 157 [2019-01-20 10:28:45,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-20 10:28:45,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-01-20 10:28:45,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2019-01-20 10:28:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-01-20 10:28:45,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2019-01-20 10:28:45,688 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2019-01-20 10:28:45,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:45,688 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2019-01-20 10:28:45,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-20 10:28:45,688 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2019-01-20 10:28:45,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-20 10:28:45,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:45,689 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2019-01-20 10:28:45,689 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:45,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:45,689 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2019-01-20 10:28:45,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:45,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:28:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:45,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-20 10:28:48,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:48,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:48,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:48,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:48,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:48,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 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-20 10:28:48,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:48,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:28:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:48,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:28:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-20 10:28:48,191 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:28:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2019-01-20 10:28:54,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:28:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-20 10:28:54,560 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:28:54,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-20 10:28:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-20 10:28:54,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:28:54,561 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2019-01-20 10:28:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:28:55,189 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2019-01-20 10:28:55,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-20 10:28:55,190 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2019-01-20 10:28:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:28:55,191 INFO L225 Difference]: With dead ends: 238 [2019-01-20 10:28:55,191 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 10:28:55,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-20 10:28:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 10:28:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2019-01-20 10:28:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-01-20 10:28:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2019-01-20 10:28:55,194 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2019-01-20 10:28:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:28:55,195 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2019-01-20 10:28:55,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-20 10:28:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2019-01-20 10:28:55,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-20 10:28:55,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:28:55,196 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2019-01-20 10:28:55,196 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:28:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:28:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2019-01-20 10:28:55,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:28:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:55,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:28:55,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:28:55,197 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:28:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:28:57,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-20 10:28:57,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:57,665 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:28:57,665 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:28:57,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:28:57,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:28:57,665 INFO 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-20 10:28:57,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:28:57,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:02,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-20 10:29:02,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:02,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-20 10:29:02,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2019-01-20 10:29:08,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:08,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-20 10:29:08,855 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:08,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-20 10:29:08,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-20 10:29:08,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:29:08,857 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2019-01-20 10:29:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:09,649 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2019-01-20 10:29:09,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-20 10:29:09,649 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2019-01-20 10:29:09,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:09,650 INFO L225 Difference]: With dead ends: 241 [2019-01-20 10:29:09,650 INFO L226 Difference]: Without dead ends: 161 [2019-01-20 10:29:09,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-20 10:29:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-01-20 10:29:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2019-01-20 10:29:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-20 10:29:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2019-01-20 10:29:09,655 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2019-01-20 10:29:09,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:09,655 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2019-01-20 10:29:09,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-20 10:29:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2019-01-20 10:29:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-20 10:29:09,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:09,656 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2019-01-20 10:29:09,656 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:09,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2019-01-20 10:29:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:09,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:09,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:09,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:09,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:09,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-20 10:29:11,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:11,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:11,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:11,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:11,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:11,898 INFO 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-20 10:29:11,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:11,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:12,013 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:12,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:12,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:12,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-20 10:29:12,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:18,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2019-01-20 10:29:18,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:18,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-20 10:29:18,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:18,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-20 10:29:18,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-20 10:29:18,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:29:18,898 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2019-01-20 10:29:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:19,740 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2019-01-20 10:29:19,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-20 10:29:19,740 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2019-01-20 10:29:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:19,741 INFO L225 Difference]: With dead ends: 244 [2019-01-20 10:29:19,741 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:29:19,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-20 10:29:19,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:29:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2019-01-20 10:29:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-01-20 10:29:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2019-01-20 10:29:19,746 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2019-01-20 10:29:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:19,747 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2019-01-20 10:29:19,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-20 10:29:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2019-01-20 10:29:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-20 10:29:19,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:19,748 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2019-01-20 10:29:19,748 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:19,748 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2019-01-20 10:29:19,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:19,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:19,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:19,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:22,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-20 10:29:22,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:22,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:22,044 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:22,044 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:22,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:22,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 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-20 10:29:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:22,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:22,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:22,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-20 10:29:22,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:29,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2019-01-20 10:29:29,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:29,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-20 10:29:29,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:29,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-20 10:29:29,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-20 10:29:29,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:29:29,419 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2019-01-20 10:29:30,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:30,291 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2019-01-20 10:29:30,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-20 10:29:30,292 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2019-01-20 10:29:30,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:30,292 INFO L225 Difference]: With dead ends: 247 [2019-01-20 10:29:30,292 INFO L226 Difference]: Without dead ends: 165 [2019-01-20 10:29:30,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-20 10:29:30,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-01-20 10:29:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2019-01-20 10:29:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-01-20 10:29:30,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2019-01-20 10:29:30,296 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2019-01-20 10:29:30,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:30,296 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2019-01-20 10:29:30,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-20 10:29:30,296 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2019-01-20 10:29:30,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-01-20 10:29:30,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:30,297 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2019-01-20 10:29:30,297 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2019-01-20 10:29:30,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:30,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:30,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:30,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:32,580 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-20 10:29:32,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:32,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:32,581 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:32,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:32,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:32,581 INFO 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-20 10:29:32,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:29:32,589 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:29:35,560 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-20 10:29:35,561 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:35,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-20 10:29:35,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2019-01-20 10:29:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:42,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-20 10:29:42,487 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:42,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-20 10:29:42,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-20 10:29:42,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:29:42,489 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2019-01-20 10:29:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:43,369 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2019-01-20 10:29:43,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-20 10:29:43,370 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2019-01-20 10:29:43,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:43,370 INFO L225 Difference]: With dead ends: 250 [2019-01-20 10:29:43,370 INFO L226 Difference]: Without dead ends: 167 [2019-01-20 10:29:43,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-20 10:29:43,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-01-20 10:29:43,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2019-01-20 10:29:43,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-01-20 10:29:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2019-01-20 10:29:43,375 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2019-01-20 10:29:43,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:43,375 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2019-01-20 10:29:43,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-20 10:29:43,375 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2019-01-20 10:29:43,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-01-20 10:29:43,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:43,376 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2019-01-20 10:29:43,376 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:43,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:43,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2019-01-20 10:29:43,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:43,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:43,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:43,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:43,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-20 10:29:46,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:46,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:46,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:46,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:46,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:46,028 INFO 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-20 10:29:46,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:29:46,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:29:46,177 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:29:46,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:29:46,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-20 10:29:46,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:29:53,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2019-01-20 10:29:53,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:29:53,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-20 10:29:53,142 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:29:53,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-20 10:29:53,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-20 10:29:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:29:53,144 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2019-01-20 10:29:53,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:29:53,870 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2019-01-20 10:29:53,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-20 10:29:53,870 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2019-01-20 10:29:53,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:29:53,871 INFO L225 Difference]: With dead ends: 253 [2019-01-20 10:29:53,871 INFO L226 Difference]: Without dead ends: 169 [2019-01-20 10:29:53,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-20 10:29:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-20 10:29:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2019-01-20 10:29:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-01-20 10:29:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2019-01-20 10:29:53,874 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2019-01-20 10:29:53,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:29:53,874 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2019-01-20 10:29:53,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-20 10:29:53,874 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2019-01-20 10:29:53,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-01-20 10:29:53,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:29:53,875 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2019-01-20 10:29:53,875 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:29:53,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:29:53,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2019-01-20 10:29:53,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:29:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:53,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:29:53,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:29:53,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:29:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-20 10:29:56,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:56,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:29:56,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:29:56,740 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:29:56,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:29:56,740 INFO 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-20 10:29:56,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:29:56,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:29:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:29:56,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:29:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-20 10:29:56,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:04,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2019-01-20 10:30:04,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:04,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-20 10:30:04,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:04,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-20 10:30:04,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-20 10:30:04,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:30:04,081 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2019-01-20 10:30:04,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:04,954 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2019-01-20 10:30:04,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-20 10:30:04,955 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2019-01-20 10:30:04,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:04,955 INFO L225 Difference]: With dead ends: 256 [2019-01-20 10:30:04,955 INFO L226 Difference]: Without dead ends: 171 [2019-01-20 10:30:04,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-20 10:30:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-01-20 10:30:04,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2019-01-20 10:30:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-20 10:30:04,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2019-01-20 10:30:04,959 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2019-01-20 10:30:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:04,959 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2019-01-20 10:30:04,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-20 10:30:04,960 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2019-01-20 10:30:04,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-20 10:30:04,960 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:04,960 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2019-01-20 10:30:04,960 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:04,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:04,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2019-01-20 10:30:04,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:04,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:04,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:04,961 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:07,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-20 10:30:07,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:07,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:07,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:07,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:07,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:07,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-20 10:30:07,438 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:07,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:30:15,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-20 10:30:15,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:16,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-20 10:30:16,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-20 10:30:23,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:23,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-20 10:30:23,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:23,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-20 10:30:23,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-20 10:30:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:30:23,473 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2019-01-20 10:30:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:24,481 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2019-01-20 10:30:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-20 10:30:24,481 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2019-01-20 10:30:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:24,482 INFO L225 Difference]: With dead ends: 259 [2019-01-20 10:30:24,482 INFO L226 Difference]: Without dead ends: 173 [2019-01-20 10:30:24,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-20 10:30:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-20 10:30:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2019-01-20 10:30:24,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-20 10:30:24,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2019-01-20 10:30:24,486 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2019-01-20 10:30:24,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:24,486 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2019-01-20 10:30:24,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-20 10:30:24,486 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2019-01-20 10:30:24,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-01-20 10:30:24,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:24,487 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2019-01-20 10:30:24,488 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2019-01-20 10:30:24,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:24,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:24,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:24,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-20 10:30:27,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:27,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:27,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:27,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:27,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:27,360 INFO 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-20 10:30:27,368 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:30:27,368 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:30:27,486 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:30:27,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:30:27,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:27,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-20 10:30:27,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2019-01-20 10:30:35,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:35,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-20 10:30:35,260 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:35,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-20 10:30:35,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-20 10:30:35,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:30:35,262 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2019-01-20 10:30:36,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:36,330 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2019-01-20 10:30:36,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-20 10:30:36,331 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2019-01-20 10:30:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:36,331 INFO L225 Difference]: With dead ends: 262 [2019-01-20 10:30:36,331 INFO L226 Difference]: Without dead ends: 175 [2019-01-20 10:30:36,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-20 10:30:36,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-01-20 10:30:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-01-20 10:30:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-01-20 10:30:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2019-01-20 10:30:36,337 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2019-01-20 10:30:36,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:36,337 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2019-01-20 10:30:36,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-20 10:30:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2019-01-20 10:30:36,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-20 10:30:36,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:36,338 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2019-01-20 10:30:36,340 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:36,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:36,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2019-01-20 10:30:36,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:36,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:30:36,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:36,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:36,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-20 10:30:39,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:39,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:39,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:39,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:39,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:39,042 INFO 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-20 10:30:39,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:39,054 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:30:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:39,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:30:39,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-20 10:30:39,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:30:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-20 10:30:47,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:30:47,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-20 10:30:47,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:30:47,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-20 10:30:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-20 10:30:47,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:30:47,159 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2019-01-20 10:30:48,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:30:48,191 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2019-01-20 10:30:48,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-20 10:30:48,191 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2019-01-20 10:30:48,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:30:48,192 INFO L225 Difference]: With dead ends: 265 [2019-01-20 10:30:48,192 INFO L226 Difference]: Without dead ends: 177 [2019-01-20 10:30:48,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-20 10:30:48,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-20 10:30:48,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2019-01-20 10:30:48,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-01-20 10:30:48,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2019-01-20 10:30:48,198 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2019-01-20 10:30:48,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:30:48,198 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2019-01-20 10:30:48,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-20 10:30:48,199 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2019-01-20 10:30:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-01-20 10:30:48,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:30:48,199 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2019-01-20 10:30:48,200 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:30:48,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:30:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2019-01-20 10:30:48,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:30:48,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:48,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:30:48,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:30:48,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:30:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:30:51,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-20 10:30:51,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:51,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:30:51,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:30:51,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:30:51,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:30:51,206 INFO 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-20 10:30:51,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:30:51,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:00,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-20 10:31:00,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:00,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:00,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-20 10:31:00,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:08,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2019-01-20 10:31:08,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:08,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-20 10:31:08,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:08,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-20 10:31:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-20 10:31:08,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:31:08,436 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2019-01-20 10:31:09,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:09,359 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2019-01-20 10:31:09,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-20 10:31:09,359 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2019-01-20 10:31:09,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:09,360 INFO L225 Difference]: With dead ends: 268 [2019-01-20 10:31:09,360 INFO L226 Difference]: Without dead ends: 179 [2019-01-20 10:31:09,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-20 10:31:09,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-20 10:31:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-01-20 10:31:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-20 10:31:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2019-01-20 10:31:09,365 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2019-01-20 10:31:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:09,365 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2019-01-20 10:31:09,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-20 10:31:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2019-01-20 10:31:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-01-20 10:31:09,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:09,366 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2019-01-20 10:31:09,366 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2019-01-20 10:31:09,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:09,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:09,367 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-20 10:31:12,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:12,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:12,385 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:12,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:12,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:12,385 INFO 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-20 10:31:12,394 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:12,394 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:12,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:12,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:12,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:12,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-20 10:31:12,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2019-01-20 10:31:20,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:20,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-20 10:31:20,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:20,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-20 10:31:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-20 10:31:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:31:20,622 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2019-01-20 10:31:21,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:21,753 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2019-01-20 10:31:21,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-20 10:31:21,754 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2019-01-20 10:31:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:21,754 INFO L225 Difference]: With dead ends: 271 [2019-01-20 10:31:21,755 INFO L226 Difference]: Without dead ends: 181 [2019-01-20 10:31:21,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-20 10:31:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-01-20 10:31:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2019-01-20 10:31:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-20 10:31:21,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2019-01-20 10:31:21,759 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2019-01-20 10:31:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:21,759 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2019-01-20 10:31:21,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-20 10:31:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2019-01-20 10:31:21,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-20 10:31:21,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:21,760 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2019-01-20 10:31:21,760 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:21,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:21,760 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2019-01-20 10:31:21,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:21,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:21,761 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:21,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:21,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:24,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-20 10:31:24,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:24,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:24,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:24,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:24,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:24,569 INFO 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-20 10:31:24,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:24,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:31:24,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:24,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-20 10:31:24,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2019-01-20 10:31:33,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:33,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-20 10:31:33,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:33,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-20 10:31:33,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-20 10:31:33,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:31:33,276 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2019-01-20 10:31:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:34,208 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2019-01-20 10:31:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-20 10:31:34,208 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2019-01-20 10:31:34,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:34,209 INFO L225 Difference]: With dead ends: 274 [2019-01-20 10:31:34,209 INFO L226 Difference]: Without dead ends: 183 [2019-01-20 10:31:34,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-20 10:31:34,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-01-20 10:31:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2019-01-20 10:31:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-01-20 10:31:34,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2019-01-20 10:31:34,213 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2019-01-20 10:31:34,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:34,213 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2019-01-20 10:31:34,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-20 10:31:34,214 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2019-01-20 10:31:34,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-20 10:31:34,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:34,214 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2019-01-20 10:31:34,214 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:34,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:34,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2019-01-20 10:31:34,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:34,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:34,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:31:34,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:34,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:37,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-20 10:31:37,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:37,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:37,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:37,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:37,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:37,418 INFO 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-20 10:31:37,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:31:37,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:31:42,100 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-20 10:31:42,100 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:42,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-20 10:31:42,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:31:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2019-01-20 10:31:50,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:31:50,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-20 10:31:50,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:31:50,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-20 10:31:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-20 10:31:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-20 10:31:50,577 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2019-01-20 10:31:51,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:31:51,497 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2019-01-20 10:31:51,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-20 10:31:51,498 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2019-01-20 10:31:51,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:31:51,498 INFO L225 Difference]: With dead ends: 277 [2019-01-20 10:31:51,498 INFO L226 Difference]: Without dead ends: 185 [2019-01-20 10:31:51,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 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-20 10:31:51,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-01-20 10:31:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2019-01-20 10:31:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-20 10:31:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2019-01-20 10:31:51,503 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2019-01-20 10:31:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:31:51,503 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2019-01-20 10:31:51,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-20 10:31:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2019-01-20 10:31:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-01-20 10:31:51,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:31:51,504 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2019-01-20 10:31:51,504 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:31:51,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:31:51,505 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2019-01-20 10:31:51,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:31:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:51,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:31:51,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:31:51,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:31:51,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:31:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-20 10:31:54,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:54,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:31:54,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:31:54,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:31:54,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:31:54,775 INFO 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-20 10:31:54,783 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:31:54,783 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:31:54,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:31:54,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:31:54,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:31:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-20 10:31:54,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:03,905 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2019-01-20 10:32:03,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:03,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-20 10:32:03,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:03,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-20 10:32:03,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-20 10:32:03,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:32:03,926 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2019-01-20 10:32:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:04,885 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2019-01-20 10:32:04,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-20 10:32:04,886 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2019-01-20 10:32:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:04,886 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:32:04,886 INFO L226 Difference]: Without dead ends: 187 [2019-01-20 10:32:04,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-20 10:32:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-20 10:32:04,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2019-01-20 10:32:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-20 10:32:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2019-01-20 10:32:04,892 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2019-01-20 10:32:04,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:04,892 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2019-01-20 10:32:04,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-20 10:32:04,892 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2019-01-20 10:32:04,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-01-20 10:32:04,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:04,893 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2019-01-20 10:32:04,893 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:04,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:04,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2019-01-20 10:32:04,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:04,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:04,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:04,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:04,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-20 10:32:08,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:08,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:08,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:08,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:08,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:08,325 INFO 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-20 10:32:08,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:08,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:08,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:08,488 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-20 10:32:08,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:17,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2019-01-20 10:32:17,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:17,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-20 10:32:17,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:17,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-20 10:32:17,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-20 10:32:17,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:32:17,255 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2019-01-20 10:32:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:18,570 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2019-01-20 10:32:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-20 10:32:18,570 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2019-01-20 10:32:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:18,571 INFO L225 Difference]: With dead ends: 283 [2019-01-20 10:32:18,571 INFO L226 Difference]: Without dead ends: 189 [2019-01-20 10:32:18,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-20 10:32:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-20 10:32:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2019-01-20 10:32:18,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 10:32:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2019-01-20 10:32:18,576 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2019-01-20 10:32:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:18,576 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2019-01-20 10:32:18,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-20 10:32:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2019-01-20 10:32:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-01-20 10:32:18,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:18,578 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2019-01-20 10:32:18,578 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:18,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2019-01-20 10:32:18,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:18,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:18,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-20 10:32:21,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:21,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:21,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:21,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:21,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:21,699 INFO 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-20 10:32:21,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:32:21,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:32:26,721 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-20 10:32:26,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:26,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-20 10:32:26,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:35,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2019-01-20 10:32:35,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:35,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-20 10:32:35,970 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:35,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-20 10:32:35,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-20 10:32:35,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:32:35,973 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2019-01-20 10:32:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:37,134 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2019-01-20 10:32:37,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-20 10:32:37,134 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2019-01-20 10:32:37,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:37,135 INFO L225 Difference]: With dead ends: 286 [2019-01-20 10:32:37,135 INFO L226 Difference]: Without dead ends: 191 [2019-01-20 10:32:37,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-20 10:32:37,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-01-20 10:32:37,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2019-01-20 10:32:37,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-20 10:32:37,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2019-01-20 10:32:37,140 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2019-01-20 10:32:37,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:37,140 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2019-01-20 10:32:37,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-20 10:32:37,140 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2019-01-20 10:32:37,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-20 10:32:37,141 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:37,141 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2019-01-20 10:32:37,142 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:37,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:37,142 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2019-01-20 10:32:37,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:37,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:37,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:37,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:37,143 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-20 10:32:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:40,649 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:40,649 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:40,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:40,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:40,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 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-20 10:32:40,658 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:32:40,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:32:40,788 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:32:40,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:32:40,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-20 10:32:40,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:32:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2019-01-20 10:32:50,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:32:50,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-20 10:32:50,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:32:50,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-20 10:32:50,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-20 10:32:50,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:32:50,240 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2019-01-20 10:32:51,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:32:51,624 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2019-01-20 10:32:51,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-20 10:32:51,624 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2019-01-20 10:32:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:32:51,625 INFO L225 Difference]: With dead ends: 289 [2019-01-20 10:32:51,625 INFO L226 Difference]: Without dead ends: 193 [2019-01-20 10:32:51,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-20 10:32:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-20 10:32:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-01-20 10:32:51,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-01-20 10:32:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2019-01-20 10:32:51,629 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2019-01-20 10:32:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:32:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2019-01-20 10:32:51,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-20 10:32:51,629 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2019-01-20 10:32:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-20 10:32:51,630 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:32:51,630 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2019-01-20 10:32:51,630 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:32:51,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:32:51,630 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2019-01-20 10:32:51,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:32:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:51,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:32:51,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:32:51,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:32:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-20 10:32:55,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:55,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:32:55,030 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:32:55,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:32:55,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:32:55,030 INFO 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-20 10:32:55,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:32:55,038 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:32:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:32:55,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:32:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-20 10:32:55,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2019-01-20 10:33:04,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:04,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-20 10:33:04,738 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:04,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-20 10:33:04,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-20 10:33:04,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:33:04,740 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2019-01-20 10:33:06,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:06,160 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2019-01-20 10:33:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-20 10:33:06,160 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2019-01-20 10:33:06,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:06,161 INFO L225 Difference]: With dead ends: 292 [2019-01-20 10:33:06,161 INFO L226 Difference]: Without dead ends: 195 [2019-01-20 10:33:06,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-20 10:33:06,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-20 10:33:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2019-01-20 10:33:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-20 10:33:06,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2019-01-20 10:33:06,166 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2019-01-20 10:33:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:06,166 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2019-01-20 10:33:06,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-20 10:33:06,167 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2019-01-20 10:33:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-20 10:33:06,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:06,168 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2019-01-20 10:33:06,168 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2019-01-20 10:33:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:06,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:06,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:09,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-20 10:33:09,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:09,721 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:09,721 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:09,721 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:09,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:09,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 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-20 10:33:09,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:33:09,730 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:33:15,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-20 10:33:15,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:15,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-20 10:33:15,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2019-01-20 10:33:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:25,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-20 10:33:25,535 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:25,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-20 10:33:25,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-20 10:33:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:33:25,538 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2019-01-20 10:33:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:27,187 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2019-01-20 10:33:27,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-20 10:33:27,188 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2019-01-20 10:33:27,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:27,188 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:33:27,189 INFO L226 Difference]: Without dead ends: 197 [2019-01-20 10:33:27,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-20 10:33:27,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-01-20 10:33:27,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2019-01-20 10:33:27,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-20 10:33:27,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2019-01-20 10:33:27,193 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2019-01-20 10:33:27,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:27,194 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2019-01-20 10:33:27,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-20 10:33:27,194 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2019-01-20 10:33:27,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-01-20 10:33:27,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:27,195 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2019-01-20 10:33:27,195 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:27,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:27,195 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2019-01-20 10:33:27,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:27,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:27,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:27,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:30,806 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-20 10:33:30,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:30,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:30,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:30,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:30,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:30,807 INFO 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-20 10:33:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:33:30,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:33:30,952 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:33:30,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:33:30,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:30,986 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-20 10:33:30,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2019-01-20 10:33:41,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:41,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-20 10:33:41,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:41,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-20 10:33:41,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-20 10:33:41,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:33:41,110 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2019-01-20 10:33:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:42,667 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2019-01-20 10:33:42,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-20 10:33:42,667 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2019-01-20 10:33:42,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:42,668 INFO L225 Difference]: With dead ends: 298 [2019-01-20 10:33:42,668 INFO L226 Difference]: Without dead ends: 199 [2019-01-20 10:33:42,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-20 10:33:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-20 10:33:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2019-01-20 10:33:42,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-01-20 10:33:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2019-01-20 10:33:42,671 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2019-01-20 10:33:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:42,672 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2019-01-20 10:33:42,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-20 10:33:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2019-01-20 10:33:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-20 10:33:42,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:42,672 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2019-01-20 10:33:42,673 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:42,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:42,673 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2019-01-20 10:33:42,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:42,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:33:42,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:42,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:46,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-20 10:33:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:46,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:33:46,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:33:46,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:33:46,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:33:46,245 INFO 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-20 10:33:46,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:46,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:33:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:33:46,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:33:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-20 10:33:46,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:33:56,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2019-01-20 10:33:56,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:33:56,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-20 10:33:56,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:33:56,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-20 10:33:56,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-20 10:33:56,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:33:56,580 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2019-01-20 10:33:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:33:57,843 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2019-01-20 10:33:57,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-20 10:33:57,844 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2019-01-20 10:33:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:33:57,844 INFO L225 Difference]: With dead ends: 301 [2019-01-20 10:33:57,844 INFO L226 Difference]: Without dead ends: 201 [2019-01-20 10:33:57,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-20 10:33:57,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-01-20 10:33:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2019-01-20 10:33:57,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-20 10:33:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2019-01-20 10:33:57,849 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2019-01-20 10:33:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:33:57,849 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2019-01-20 10:33:57,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-20 10:33:57,849 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2019-01-20 10:33:57,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-20 10:33:57,850 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:33:57,850 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2019-01-20 10:33:57,851 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:33:57,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:33:57,851 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2019-01-20 10:33:57,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:33:57,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:57,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:33:57,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:33:57,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:33:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-20 10:34:01,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:01,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:01,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:01,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:01,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:01,531 INFO 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-20 10:34:01,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:34:01,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:34:16,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-20 10:34:16,189 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:16,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-20 10:34:16,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:26,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2019-01-20 10:34:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:26,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-20 10:34:26,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:26,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-20 10:34:26,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-20 10:34:26,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:34:26,747 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2019-01-20 10:34:28,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:28,348 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2019-01-20 10:34:28,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-20 10:34:28,349 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2019-01-20 10:34:28,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:28,349 INFO L225 Difference]: With dead ends: 304 [2019-01-20 10:34:28,349 INFO L226 Difference]: Without dead ends: 203 [2019-01-20 10:34:28,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-20 10:34:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-20 10:34:28,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2019-01-20 10:34:28,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-01-20 10:34:28,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2019-01-20 10:34:28,353 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2019-01-20 10:34:28,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:28,354 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2019-01-20 10:34:28,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-20 10:34:28,354 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2019-01-20 10:34:28,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-01-20 10:34:28,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:28,354 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2019-01-20 10:34:28,354 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:28,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:28,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2019-01-20 10:34:28,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:28,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:28,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:28,355 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-20 10:34:32,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:32,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:32,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:32,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:32,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:32,247 INFO 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-20 10:34:32,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:34:32,255 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:34:32,393 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:34:32,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:34:32,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-20 10:34:32,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2019-01-20 10:34:42,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:42,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-20 10:34:42,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:42,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-20 10:34:42,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-20 10:34:42,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:34:42,902 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2019-01-20 10:34:44,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:34:44,534 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2019-01-20 10:34:44,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-20 10:34:44,534 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2019-01-20 10:34:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:34:44,535 INFO L225 Difference]: With dead ends: 307 [2019-01-20 10:34:44,535 INFO L226 Difference]: Without dead ends: 205 [2019-01-20 10:34:44,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-20 10:34:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-01-20 10:34:44,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2019-01-20 10:34:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-01-20 10:34:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2019-01-20 10:34:44,539 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2019-01-20 10:34:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:34:44,539 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2019-01-20 10:34:44,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-20 10:34:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2019-01-20 10:34:44,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-01-20 10:34:44,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:34:44,540 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2019-01-20 10:34:44,540 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:34:44,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:34:44,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2019-01-20 10:34:44,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:34:44,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:44,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:34:44,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:34:44,541 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:34:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:48,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-20 10:34:48,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:48,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:34:48,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:34:48,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:34:48,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:34:48,374 INFO 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-20 10:34:48,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:34:48,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:34:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:34:48,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:34:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-20 10:34:48,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:34:59,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2019-01-20 10:34:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:34:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-20 10:34:59,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:34:59,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-20 10:34:59,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-20 10:34:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:34:59,428 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2019-01-20 10:35:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:01,065 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2019-01-20 10:35:01,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-20 10:35:01,065 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2019-01-20 10:35:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:01,067 INFO L225 Difference]: With dead ends: 310 [2019-01-20 10:35:01,067 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:35:01,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-20 10:35:01,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:35:01,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2019-01-20 10:35:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-01-20 10:35:01,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2019-01-20 10:35:01,073 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2019-01-20 10:35:01,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:01,073 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2019-01-20 10:35:01,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-20 10:35:01,073 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2019-01-20 10:35:01,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-01-20 10:35:01,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:01,074 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2019-01-20 10:35:01,074 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:01,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:01,075 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2019-01-20 10:35:01,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:01,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:01,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:01,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:05,085 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-20 10:35:05,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:05,085 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:05,085 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:05,085 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:05,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:05,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 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-20 10:35:05,094 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:35:05,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:35:23,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-20 10:35:23,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:23,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-20 10:35:23,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2019-01-20 10:35:34,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:34,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-20 10:35:34,667 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:34,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-20 10:35:34,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-20 10:35:34,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:35:34,671 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2019-01-20 10:35:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:36,429 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2019-01-20 10:35:36,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-20 10:35:36,430 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2019-01-20 10:35:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:36,431 INFO L225 Difference]: With dead ends: 313 [2019-01-20 10:35:36,431 INFO L226 Difference]: Without dead ends: 209 [2019-01-20 10:35:36,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-20 10:35:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-20 10:35:36,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2019-01-20 10:35:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-20 10:35:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2019-01-20 10:35:36,437 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2019-01-20 10:35:36,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:36,437 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2019-01-20 10:35:36,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-20 10:35:36,437 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2019-01-20 10:35:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-20 10:35:36,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:36,438 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2019-01-20 10:35:36,438 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2019-01-20 10:35:36,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:36,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:36,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:36,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:36,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-20 10:35:40,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:40,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:40,438 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:40,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:40,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:40,438 INFO 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-20 10:35:40,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:35:40,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:35:40,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:35:40,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:35:40,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:40,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-20 10:35:40,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:35:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2019-01-20 10:35:51,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:35:51,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-20 10:35:51,941 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:35:51,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-20 10:35:51,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-20 10:35:51,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:35:51,944 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2019-01-20 10:35:53,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:35:53,442 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2019-01-20 10:35:53,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-20 10:35:53,442 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2019-01-20 10:35:53,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:35:53,443 INFO L225 Difference]: With dead ends: 316 [2019-01-20 10:35:53,443 INFO L226 Difference]: Without dead ends: 211 [2019-01-20 10:35:53,445 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-20 10:35:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-01-20 10:35:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2019-01-20 10:35:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-20 10:35:53,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2019-01-20 10:35:53,449 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2019-01-20 10:35:53,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:35:53,450 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2019-01-20 10:35:53,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-20 10:35:53,450 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2019-01-20 10:35:53,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-20 10:35:53,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:35:53,451 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2019-01-20 10:35:53,451 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:35:53,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:35:53,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2019-01-20 10:35:53,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:35:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:53,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:35:53,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:35:53,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:35:53,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-20 10:35:57,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:57,185 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:35:57,185 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:35:57,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:35:57,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:35:57,186 INFO 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-20 10:35:57,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:35:57,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:35:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:35:57,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:35:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-20 10:35:57,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2019-01-20 10:36:09,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:09,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-20 10:36:09,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-20 10:36:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-20 10:36:09,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:36:09,311 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2019-01-20 10:36:11,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:11,104 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2019-01-20 10:36:11,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-20 10:36:11,104 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2019-01-20 10:36:11,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:11,105 INFO L225 Difference]: With dead ends: 319 [2019-01-20 10:36:11,105 INFO L226 Difference]: Without dead ends: 213 [2019-01-20 10:36:11,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-20 10:36:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-01-20 10:36:11,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2019-01-20 10:36:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2019-01-20 10:36:11,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2019-01-20 10:36:11,111 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2019-01-20 10:36:11,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:11,111 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2019-01-20 10:36:11,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-20 10:36:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2019-01-20 10:36:11,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-20 10:36:11,112 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:11,112 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2019-01-20 10:36:11,113 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:11,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:11,113 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2019-01-20 10:36:11,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:11,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:11,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:36:11,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:11,114 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:36:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-20 10:36:15,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:15,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:36:15,251 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:36:15,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:36:15,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:36:15,251 INFO 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-20 10:36:15,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:36:15,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:36:23,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-20 10:36:23,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:36:23,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:36:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-20 10:36:23,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:36:35,633 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2019-01-20 10:36:35,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:36:35,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-20 10:36:35,662 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:36:35,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-20 10:36:35,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-20 10:36:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:36:35,665 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 107 states. [2019-01-20 10:36:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:36:37,228 INFO L93 Difference]: Finished difference Result 322 states and 325 transitions. [2019-01-20 10:36:37,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-20 10:36:37,228 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2019-01-20 10:36:37,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:36:37,229 INFO L225 Difference]: With dead ends: 322 [2019-01-20 10:36:37,229 INFO L226 Difference]: Without dead ends: 215 [2019-01-20 10:36:37,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-20 10:36:37,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-01-20 10:36:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-01-20 10:36:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-20 10:36:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2019-01-20 10:36:37,234 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 212 [2019-01-20 10:36:37,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:36:37,234 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2019-01-20 10:36:37,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-20 10:36:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2019-01-20 10:36:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-01-20 10:36:37,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:36:37,235 INFO L402 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1] [2019-01-20 10:36:37,235 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:36:37,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:36:37,235 INFO L82 PathProgramCache]: Analyzing trace with hash 913063733, now seen corresponding path program 105 times [2019-01-20 10:36:37,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:36:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:37,236 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:36:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:36:37,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:36:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat