java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:46:56,811 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:46:56,813 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:46:56,826 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:46:56,826 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:46:56,828 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:46:56,829 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:46:56,831 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:46:56,833 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:46:56,836 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:46:56,839 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:46:56,840 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:46:56,841 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:46:56,842 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:46:56,846 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:46:56,847 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:46:56,848 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:46:56,849 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:46:56,860 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:46:56,862 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:46:56,863 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:46:56,864 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:46:56,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:46:56,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:46:56,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:46:56,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:46:56,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:46:56,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:46:56,871 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:46:56,872 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:46:56,872 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:46:56,873 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:46:56,873 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:46:56,873 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:46:56,875 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:46:56,875 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:46:56,876 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:46:56,890 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:46:56,891 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:46:56,892 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:46:56,893 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:46:56,893 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:46:56,893 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:46:56,893 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:46:56,894 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:46:56,897 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:46:56,897 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:46:56,897 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:46:56,897 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:46:56,897 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:46:56,898 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:46:56,899 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:46:56,899 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:46:56,899 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:46:56,899 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:46:56,900 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:46:56,901 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:46:56,902 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:46:56,902 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:46:56,902 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:46:56,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:46:56,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:46:56,903 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:46:56,903 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:46:56,903 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:46:56,903 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:46:56,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:46:56,904 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:46:56,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:46:56,905 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:46:56,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:46:56,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:46:56,906 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:46:56,906 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:46:56,944 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:46:56,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:46:56,968 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:46:56,969 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:46:56,970 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:46:56,971 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 [2018-12-24 13:46:56,971 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array3.i_4.bpl' [2018-12-24 13:46:57,031 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:46:57,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:46:57,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:46:57,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:46:57,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:46:57,058 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 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,074 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 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:46:57,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:46:57,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:46:57,087 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:46:57,102 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,113 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... [2018-12-24 13:46:57,116 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:46:57,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:46:57,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:46:57,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:46:57,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:46:57,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-24 13:46:57,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-24 13:46:57,380 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-24 13:46:57,380 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-24 13:46:57,381 INFO L202 PluginConnector]: Adding new model array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:57 BoogieIcfgContainer [2018-12-24 13:46:57,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:46:57,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:46:57,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:46:57,385 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:46:57,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:46:57" (1/2) ... [2018-12-24 13:46:57,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c533217 and model type array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:46:57, skipping insertion in model container [2018-12-24 13:46:57,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:46:57" (2/2) ... [2018-12-24 13:46:57,389 INFO L112 eAbstractionObserver]: Analyzing ICFG array3.i_4.bpl [2018-12-24 13:46:57,399 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:46:57,407 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 13:46:57,426 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 13:46:57,462 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:46:57,462 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:46:57,463 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:46:57,463 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:46:57,463 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:46:57,463 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:46:57,463 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:46:57,464 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:46:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 13:46:57,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-24 13:46:57,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:57,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-24 13:46:57,490 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-24 13:46:57,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:57,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:57,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:46:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:46:57,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-24 13:46:57,638 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:46:57,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:46:57,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:46:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:46:57,658 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 13:46:57,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:57,729 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2018-12-24 13:46:57,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:46:57,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-24 13:46:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:57,743 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:46:57,743 INFO L226 Difference]: Without dead ends: 7 [2018-12-24 13:46:57,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:46:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-24 13:46:57,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-24 13:46:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 13:46:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-24 13:46:57,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2018-12-24 13:46:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:57,781 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-24 13:46:57,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:46:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-24 13:46:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:46:57,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:57,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-24 13:46:57,782 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-24 13:46:57,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:57,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:57,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:57,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:46:57,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:57,881 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:57,882 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:46:57,885 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-24 13:46:57,934 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:46:57,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:46:58,140 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:46:58,141 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 6. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-24 13:46:58,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:46:58,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,155 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:46:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:58,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:46:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:58,223 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:46:58,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-24 13:46:58,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:58,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-24 13:46:58,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:58,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-24 13:46:58,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-24 13:46:58,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:46:58,293 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2018-12-24 13:46:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:58,338 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2018-12-24 13:46:58,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:46:58,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-24 13:46:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:58,339 INFO L225 Difference]: With dead ends: 13 [2018-12-24 13:46:58,339 INFO L226 Difference]: Without dead ends: 9 [2018-12-24 13:46:58,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-24 13:46:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-24 13:46:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-24 13:46:58,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-24 13:46:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-24 13:46:58,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-24 13:46:58,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:58,344 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-24 13:46:58,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-24 13:46:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-24 13:46:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-24 13:46:58,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:58,345 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-24 13:46:58,345 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,346 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2018-12-24 13:46:58,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:58,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,347 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:46:58,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:58,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:58,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:58,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:58,417 INFO 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 [2018-12-24 13:46:58,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:46:58,433 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:46:58,480 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-24 13:46:58,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:46:58,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:58,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:46:58,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-24 13:46:58,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:58,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-24 13:46:58,713 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:58,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-24 13:46:58,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-24 13:46:58,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:46:58,715 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-12-24 13:46:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:58,895 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-24 13:46:58,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:46:58,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-12-24 13:46:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:58,897 INFO L225 Difference]: With dead ends: 16 [2018-12-24 13:46:58,897 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 13:46:58,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:46:58,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 13:46:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-24 13:46:58,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-24 13:46:58,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-24 13:46:58,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-24 13:46:58,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:58,902 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-24 13:46:58,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-24 13:46:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-24 13:46:58,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-24 13:46:58,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:58,904 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-24 13:46:58,904 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:58,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2018-12-24 13:46:58,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:46:58,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:58,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:59,009 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 13:46:59,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:59,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:59,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:59,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,011 INFO 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 [2018-12-24 13:46:59,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:46:59,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:46:59,064 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:46:59,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:46:59,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 13:46:59,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-24 13:46:59,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:59,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-24 13:46:59,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:59,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:46:59,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:46:59,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:46:59,280 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2018-12-24 13:46:59,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:59,341 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-24 13:46:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:46:59,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-24 13:46:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:59,343 INFO L225 Difference]: With dead ends: 19 [2018-12-24 13:46:59,343 INFO L226 Difference]: Without dead ends: 13 [2018-12-24 13:46:59,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-24 13:46:59,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-24 13:46:59,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-24 13:46:59,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:46:59,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-24 13:46:59,347 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-12-24 13:46:59,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:59,348 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-24 13:46:59,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:46:59,348 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-24 13:46:59,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 13:46:59,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:59,349 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-24 13:46:59,349 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:59,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2018-12-24 13:46:59,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:46:59,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:59,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 13:46:59,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:46:59,497 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:46:59,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:46:59,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:46:59,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:46:59,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:59,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:46:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:46:59,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:46:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 13:46:59,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:46:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-24 13:46:59,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:46:59,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-24 13:46:59,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:46:59,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-24 13:46:59,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-24 13:46:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-24 13:46:59,663 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2018-12-24 13:46:59,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:46:59,817 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2018-12-24 13:46:59,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:46:59,819 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-24 13:46:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:46:59,819 INFO L225 Difference]: With dead ends: 22 [2018-12-24 13:46:59,820 INFO L226 Difference]: Without dead ends: 15 [2018-12-24 13:46:59,820 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 [2018-12-24 13:46:59,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-24 13:46:59,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-24 13:46:59,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-24 13:46:59,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-24 13:46:59,828 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-24 13:46:59,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:46:59,832 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-24 13:46:59,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-24 13:46:59,832 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-24 13:46:59,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-24 13:46:59,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:46:59,833 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-24 13:46:59,833 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:46:59,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:46:59,834 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2018-12-24 13:46:59,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:46:59,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:46:59,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:46:59,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:46:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 13:47:00,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,139 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:00,140 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:00,140 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:00,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,140 INFO 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 [2018-12-24 13:47:00,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:00,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:00,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-24 13:47:00,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:00,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:00,200 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 13:47:00,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-24 13:47:00,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:00,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-24 13:47:00,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:00,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:47:00,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:47:00,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:00,366 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2018-12-24 13:47:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:00,405 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-24 13:47:00,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:47:00,406 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-24 13:47:00,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:00,407 INFO L225 Difference]: With dead ends: 25 [2018-12-24 13:47:00,407 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:47:00,408 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 [2018-12-24 13:47:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:47:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-24 13:47:00,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-24 13:47:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-24 13:47:00,412 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-12-24 13:47:00,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:00,413 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-24 13:47:00,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:47:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-24 13:47:00,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-24 13:47:00,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:00,414 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-24 13:47:00,414 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:00,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:00,414 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2018-12-24 13:47:00,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:00,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:00,415 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:00,555 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 13:47:00,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:00,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:00,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:00,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:00,556 INFO 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 [2018-12-24 13:47:00,566 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:00,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:00,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:00,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:00,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 13:47:00,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-24 13:47:00,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:00,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-24 13:47:00,950 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:00,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-24 13:47:00,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-24 13:47:00,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:47:00,951 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2018-12-24 13:47:01,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:01,039 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-12-24 13:47:01,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:47:01,039 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-24 13:47:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:01,040 INFO L225 Difference]: With dead ends: 28 [2018-12-24 13:47:01,040 INFO L226 Difference]: Without dead ends: 19 [2018-12-24 13:47:01,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-24 13:47:01,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-24 13:47:01,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-24 13:47:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 13:47:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-24 13:47:01,045 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-24 13:47:01,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:01,046 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-24 13:47:01,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-24 13:47:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-24 13:47:01,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 13:47:01,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:01,047 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-24 13:47:01,047 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:01,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:01,047 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2018-12-24 13:47:01,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:01,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:01,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,049 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:01,225 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-24 13:47:01,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:01,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:01,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:01,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,226 INFO 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 [2018-12-24 13:47:01,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:01,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:01,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:01,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-24 13:47:01,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:01,519 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-24 13:47:01,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:01,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-24 13:47:01,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:01,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:47:01,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:47:01,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:47:01,540 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-12-24 13:47:01,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:01,584 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-12-24 13:47:01,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:47:01,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-24 13:47:01,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:01,588 INFO L225 Difference]: With dead ends: 31 [2018-12-24 13:47:01,588 INFO L226 Difference]: Without dead ends: 21 [2018-12-24 13:47:01,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-24 13:47:01,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-24 13:47:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-24 13:47:01,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-24 13:47:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-24 13:47:01,593 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-24 13:47:01,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:01,593 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-24 13:47:01,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:47:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-24 13:47:01,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-24 13:47:01,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:01,594 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-24 13:47:01,594 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:01,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2018-12-24 13:47:01,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:01,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:01,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 13:47:01,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:01,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:01,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:01,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:01,743 INFO 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 [2018-12-24 13:47:01,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:01,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:01,784 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-24 13:47:01,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:01,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:01,793 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 13:47:01,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:02,094 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-24 13:47:02,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:02,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-24 13:47:02,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:02,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-24 13:47:02,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-24 13:47:02,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:02,116 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2018-12-24 13:47:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:02,355 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-12-24 13:47:02,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:47:02,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-24 13:47:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:02,356 INFO L225 Difference]: With dead ends: 34 [2018-12-24 13:47:02,356 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 13:47:02,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 13:47:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-24 13:47:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-24 13:47:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-24 13:47:02,361 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-24 13:47:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:02,362 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-24 13:47:02,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-24 13:47:02,362 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-24 13:47:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-24 13:47:02,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:02,363 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-24 13:47:02,363 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:02,364 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2018-12-24 13:47:02,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:02,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:02,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:02,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-24 13:47:02,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:02,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:02,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:02,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:02,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:02,576 INFO 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 [2018-12-24 13:47:02,584 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:02,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:02,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:02,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:02,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:02,656 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-24 13:47:02,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-12-24 13:47:03,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:03,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-24 13:47:03,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:03,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:47:03,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:47:03,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:03,138 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2018-12-24 13:47:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:03,326 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2018-12-24 13:47:03,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 13:47:03,326 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-24 13:47:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:03,327 INFO L225 Difference]: With dead ends: 37 [2018-12-24 13:47:03,327 INFO L226 Difference]: Without dead ends: 25 [2018-12-24 13:47:03,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-24 13:47:03,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-24 13:47:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-24 13:47:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 13:47:03,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-24 13:47:03,332 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-12-24 13:47:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:03,333 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-24 13:47:03,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:47:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-24 13:47:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 13:47:03,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:03,334 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-24 13:47:03,334 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:03,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2018-12-24 13:47:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:03,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,336 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:03,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:03,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 13:47:03,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:03,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:03,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:03,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:03,524 INFO 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 [2018-12-24 13:47:03,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:03,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:03,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 13:47:03,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:04,133 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-24 13:47:04,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:04,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-24 13:47:04,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:04,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-24 13:47:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-24 13:47:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 13:47:04,154 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2018-12-24 13:47:04,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:04,243 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-24 13:47:04,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 13:47:04,244 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-24 13:47:04,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:04,245 INFO L225 Difference]: With dead ends: 40 [2018-12-24 13:47:04,245 INFO L226 Difference]: Without dead ends: 27 [2018-12-24 13:47:04,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-24 13:47:04,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-24 13:47:04,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-24 13:47:04,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-24 13:47:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-24 13:47:04,251 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-24 13:47:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:04,251 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-24 13:47:04,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-24 13:47:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-24 13:47:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-24 13:47:04,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:04,252 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-24 13:47:04,252 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2018-12-24 13:47:04,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:04,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-24 13:47:04,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:04,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:04,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:04,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:04,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:04,532 INFO 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 [2018-12-24 13:47:04,540 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:04,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:04,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-24 13:47:04,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:04,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:04,591 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-24 13:47:04,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-12-24 13:47:04,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:04,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-24 13:47:04,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:04,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:47:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:47:04,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:04,871 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 14 states. [2018-12-24 13:47:04,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:04,935 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-12-24 13:47:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 13:47:04,936 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-24 13:47:04,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:04,937 INFO L225 Difference]: With dead ends: 43 [2018-12-24 13:47:04,937 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 13:47:04,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 13:47:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-24 13:47:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-24 13:47:04,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-24 13:47:04,944 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-24 13:47:04,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:04,944 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-24 13:47:04,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:47:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-24 13:47:04,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-24 13:47:04,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:04,945 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-24 13:47:04,945 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:04,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:04,946 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2018-12-24 13:47:04,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:04,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:04,947 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 13:47:05,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:05,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:05,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:05,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,139 INFO 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 [2018-12-24 13:47:05,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:05,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:05,185 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:05,185 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:05,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 13:47:05,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-24 13:47:05,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:05,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-24 13:47:05,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:05,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-24 13:47:05,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-24 13:47:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-24 13:47:05,499 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-12-24 13:47:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:05,647 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2018-12-24 13:47:05,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 13:47:05,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-24 13:47:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:05,648 INFO L225 Difference]: With dead ends: 46 [2018-12-24 13:47:05,648 INFO L226 Difference]: Without dead ends: 31 [2018-12-24 13:47:05,650 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 [2018-12-24 13:47:05,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-24 13:47:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-24 13:47:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:47:05,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-24 13:47:05,654 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-24 13:47:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:05,654 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-24 13:47:05,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-24 13:47:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-24 13:47:05,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 13:47:05,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:05,655 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-24 13:47:05,656 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:05,656 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2018-12-24 13:47:05,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:05,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:05,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:05,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-24 13:47:05,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:05,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:05,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:05,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:05,967 INFO 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 [2018-12-24 13:47:05,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:05,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:06,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:06,023 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-24 13:47:06,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-12-24 13:47:06,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:06,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-24 13:47:06,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:06,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 13:47:06,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 13:47:06,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 13:47:06,591 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2018-12-24 13:47:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:06,720 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2018-12-24 13:47:06,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 13:47:06,722 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-24 13:47:06,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:06,723 INFO L225 Difference]: With dead ends: 49 [2018-12-24 13:47:06,723 INFO L226 Difference]: Without dead ends: 33 [2018-12-24 13:47:06,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-24 13:47:06,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-24 13:47:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-24 13:47:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-24 13:47:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-24 13:47:06,728 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-12-24 13:47:06,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:06,729 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-24 13:47:06,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 13:47:06,729 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-24 13:47:06,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-24 13:47:06,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:06,730 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-24 13:47:06,730 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:06,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:06,731 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2018-12-24 13:47:06,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:06,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:06,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:06,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:06,732 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 13:47:06,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:06,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:06,940 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:06,940 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:06,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:06,940 INFO 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 [2018-12-24 13:47:06,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:06,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:06,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-24 13:47:06,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:07,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:07,009 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 13:47:07,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:07,511 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-24 13:47:07,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:07,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-24 13:47:07,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:07,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-24 13:47:07,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-24 13:47:07,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:07,531 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2018-12-24 13:47:07,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:07,589 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-12-24 13:47:07,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 13:47:07,591 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-24 13:47:07,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:07,591 INFO L225 Difference]: With dead ends: 52 [2018-12-24 13:47:07,591 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:47:07,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:47:07,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-24 13:47:07,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-24 13:47:07,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-24 13:47:07,596 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-24 13:47:07,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:07,596 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-24 13:47:07,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-24 13:47:07,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-24 13:47:07,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-24 13:47:07,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:07,597 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-24 13:47:07,598 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:07,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2018-12-24 13:47:07,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:07,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:07,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:07,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:07,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:07,893 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-24 13:47:07,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:07,893 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:07,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:07,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:07,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:07,894 INFO 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 [2018-12-24 13:47:07,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:07,906 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:07,933 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:07,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:07,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-24 13:47:07,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2018-12-24 13:47:08,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:08,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-24 13:47:08,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:08,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 13:47:08,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 13:47:08,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 13:47:08,450 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2018-12-24 13:47:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:08,555 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-24 13:47:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 13:47:08,555 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-24 13:47:08,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:08,556 INFO L225 Difference]: With dead ends: 55 [2018-12-24 13:47:08,556 INFO L226 Difference]: Without dead ends: 37 [2018-12-24 13:47:08,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-24 13:47:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-24 13:47:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-24 13:47:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:47:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-24 13:47:08,562 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-24 13:47:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:08,562 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-24 13:47:08,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 13:47:08,563 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-24 13:47:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 13:47:08,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:08,563 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-24 13:47:08,564 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:08,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2018-12-24 13:47:08,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:08,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:08,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:08,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:08,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 13:47:09,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:09,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:09,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:09,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:09,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:09,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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:09,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:09,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:09,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:09,419 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 13:47:09,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-24 13:47:10,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:10,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-24 13:47:10,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:10,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-24 13:47:10,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-24 13:47:10,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 13:47:10,368 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2018-12-24 13:47:10,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:10,430 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2018-12-24 13:47:10,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 13:47:10,431 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-24 13:47:10,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:10,431 INFO L225 Difference]: With dead ends: 58 [2018-12-24 13:47:10,432 INFO L226 Difference]: Without dead ends: 39 [2018-12-24 13:47:10,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-24 13:47:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-24 13:47:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-24 13:47:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-24 13:47:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-24 13:47:10,438 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-24 13:47:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:10,438 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-24 13:47:10,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-24 13:47:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-24 13:47:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-24 13:47:10,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:10,439 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-24 13:47:10,439 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:10,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2018-12-24 13:47:10,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:10,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:10,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:10,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-24 13:47:11,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:11,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:11,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:11,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:11,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:11,249 INFO 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 [2018-12-24 13:47:11,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:11,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:11,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-24 13:47:11,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:11,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:11,316 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-24 13:47:11,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-12-24 13:47:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:12,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-24 13:47:12,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:12,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 13:47:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 13:47:12,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:12,246 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2018-12-24 13:47:12,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:12,321 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2018-12-24 13:47:12,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 13:47:12,321 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-24 13:47:12,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:12,322 INFO L225 Difference]: With dead ends: 61 [2018-12-24 13:47:12,322 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 13:47:12,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:12,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 13:47:12,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-24 13:47:12,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-24 13:47:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-24 13:47:12,327 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-12-24 13:47:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:12,328 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-24 13:47:12,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 13:47:12,328 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-24 13:47:12,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-24 13:47:12,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:12,329 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-24 13:47:12,329 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:12,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:12,329 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2018-12-24 13:47:12,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:12,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:12,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:12,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 13:47:12,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:12,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:12,994 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:12,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:12,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:12,994 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:13,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:13,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:13,054 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:13,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:13,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:13,065 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 13:47:13,065 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:13,571 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-24 13:47:13,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:13,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-24 13:47:13,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:13,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-24 13:47:13,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-24 13:47:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 13:47:13,593 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2018-12-24 13:47:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:13,784 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-24 13:47:13,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 13:47:13,784 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-24 13:47:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:13,784 INFO L225 Difference]: With dead ends: 64 [2018-12-24 13:47:13,784 INFO L226 Difference]: Without dead ends: 43 [2018-12-24 13:47:13,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-24 13:47:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-24 13:47:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-24 13:47:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 13:47:13,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-24 13:47:13,789 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-24 13:47:13,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:13,789 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-24 13:47:13,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-24 13:47:13,789 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-24 13:47:13,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 13:47:13,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:13,790 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-24 13:47:13,790 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:13,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:13,790 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2018-12-24 13:47:13,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:13,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:13,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:13,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-24 13:47:14,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:14,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:14,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:14,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:14,757 INFO 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 [2018-12-24 13:47:14,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:14,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:14,803 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-24 13:47:14,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-24 13:47:15,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:15,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-24 13:47:15,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:15,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 13:47:15,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 13:47:15,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 13:47:15,474 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2018-12-24 13:47:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:15,552 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2018-12-24 13:47:15,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 13:47:15,553 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-24 13:47:15,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:15,553 INFO L225 Difference]: With dead ends: 67 [2018-12-24 13:47:15,554 INFO L226 Difference]: Without dead ends: 45 [2018-12-24 13:47:15,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-24 13:47:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-24 13:47:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-24 13:47:15,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-24 13:47:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-24 13:47:15,561 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-24 13:47:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:15,561 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-24 13:47:15,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 13:47:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-24 13:47:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-24 13:47:15,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:15,562 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-24 13:47:15,563 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:15,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2018-12-24 13:47:15,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:15,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:15,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:15,999 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 13:47:15,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,000 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:16,000 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:16,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:16,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,000 INFO 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 [2018-12-24 13:47:16,009 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:16,009 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:16,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-24 13:47:16,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:16,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:16,102 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 13:47:16,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-24 13:47:16,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:16,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-24 13:47:16,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:16,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-24 13:47:16,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-24 13:47:16,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:16,636 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2018-12-24 13:47:16,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:16,741 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-24 13:47:16,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 13:47:16,742 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-24 13:47:16,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:16,743 INFO L225 Difference]: With dead ends: 70 [2018-12-24 13:47:16,743 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 13:47:16,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:16,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 13:47:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-24 13:47:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-24 13:47:16,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-24 13:47:16,749 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-24 13:47:16,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:16,749 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-24 13:47:16,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-24 13:47:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-24 13:47:16,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-24 13:47:16,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:16,750 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-24 13:47:16,750 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:16,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:16,750 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2018-12-24 13:47:16,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:16,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:16,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-24 13:47:17,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:17,107 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:17,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:17,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,108 INFO 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 [2018-12-24 13:47:17,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:17,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:17,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:17,150 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:17,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:17,161 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-24 13:47:17,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:17,776 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-24 13:47:17,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:17,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-24 13:47:17,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:17,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 13:47:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 13:47:17,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:17,798 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2018-12-24 13:47:17,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:17,879 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2018-12-24 13:47:17,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 13:47:17,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-24 13:47:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:17,882 INFO L225 Difference]: With dead ends: 73 [2018-12-24 13:47:17,883 INFO L226 Difference]: Without dead ends: 49 [2018-12-24 13:47:17,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-24 13:47:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-24 13:47:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-24 13:47:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 13:47:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-24 13:47:17,888 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-12-24 13:47:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:17,888 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-24 13:47:17,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 13:47:17,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-24 13:47:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 13:47:17,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:17,889 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-24 13:47:17,889 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:17,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:17,889 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2018-12-24 13:47:17,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:17,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:17,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 13:47:18,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:18,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:18,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:18,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:18,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:18,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:18,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:18,269 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 13:47:18,269 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-24 13:47:18,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:18,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-24 13:47:18,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:18,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-24 13:47:18,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-24 13:47:18,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-24 13:47:18,877 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2018-12-24 13:47:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:19,010 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-12-24 13:47:19,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 13:47:19,012 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-24 13:47:19,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:19,012 INFO L225 Difference]: With dead ends: 76 [2018-12-24 13:47:19,013 INFO L226 Difference]: Without dead ends: 51 [2018-12-24 13:47:19,013 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 [2018-12-24 13:47:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-24 13:47:19,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-24 13:47:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-24 13:47:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-24 13:47:19,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-24 13:47:19,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:19,019 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-24 13:47:19,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-24 13:47:19,020 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-24 13:47:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-24 13:47:19,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:19,020 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-24 13:47:19,021 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2018-12-24 13:47:19,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:19,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:19,997 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-24 13:47:19,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:19,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:19,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:19,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:19,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:19,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:20,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:20,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-24 13:47:20,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:20,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:20,106 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-24 13:47:20,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-12-24 13:47:21,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:21,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-24 13:47:21,017 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:21,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 13:47:21,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 13:47:21,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:21,018 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2018-12-24 13:47:21,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:21,114 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2018-12-24 13:47:21,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 13:47:21,114 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-24 13:47:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:21,115 INFO L225 Difference]: With dead ends: 79 [2018-12-24 13:47:21,115 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 13:47:21,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:21,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 13:47:21,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-24 13:47:21,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-24 13:47:21,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-24 13:47:21,120 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-24 13:47:21,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:21,120 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-24 13:47:21,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 13:47:21,120 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-24 13:47:21,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-24 13:47:21,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:21,121 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-24 13:47:21,121 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:21,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:21,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2018-12-24 13:47:21,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:21,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:21,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 13:47:21,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:21,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:21,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:21,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,820 INFO 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 [2018-12-24 13:47:21,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:21,828 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:21,874 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:21,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:21,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 13:47:21,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-24 13:47:22,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-24 13:47:22,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:22,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-24 13:47:22,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-24 13:47:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 13:47:22,685 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2018-12-24 13:47:22,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:22,788 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2018-12-24 13:47:22,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 13:47:22,789 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-24 13:47:22,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:22,790 INFO L225 Difference]: With dead ends: 82 [2018-12-24 13:47:22,790 INFO L226 Difference]: Without dead ends: 55 [2018-12-24 13:47:22,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-24 13:47:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-24 13:47:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-24 13:47:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 13:47:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-24 13:47:22,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-24 13:47:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:22,795 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-24 13:47:22,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-24 13:47:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-24 13:47:22,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 13:47:22,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:22,796 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-24 13:47:22,796 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2018-12-24 13:47:22,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-24 13:47:23,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:23,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:23,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:23,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,603 INFO 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 [2018-12-24 13:47:23,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:23,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:23,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-24 13:47:23,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:25,454 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-12-24 13:47:25,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:25,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-24 13:47:25,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:25,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 13:47:25,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 13:47:25,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 13:47:25,475 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2018-12-24 13:47:25,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:25,624 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-24 13:47:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 13:47:25,625 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-24 13:47:25,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:25,625 INFO L225 Difference]: With dead ends: 85 [2018-12-24 13:47:25,626 INFO L226 Difference]: Without dead ends: 57 [2018-12-24 13:47:25,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-24 13:47:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-24 13:47:25,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-24 13:47:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-24 13:47:25,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-24 13:47:25,630 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-12-24 13:47:25,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:25,631 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-24 13:47:25,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 13:47:25,631 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-24 13:47:25,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-24 13:47:25,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:25,632 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-24 13:47:25,632 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:25,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:25,632 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2018-12-24 13:47:25,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:25,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:25,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 13:47:26,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:26,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:26,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:26,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:26,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:26,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:26,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:26,090 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:26,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-24 13:47:26,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:26,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:26,208 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 13:47:26,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-24 13:47:27,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:27,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-24 13:47:27,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:27,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-24 13:47:27,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-24 13:47:27,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:27,031 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2018-12-24 13:47:27,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:27,127 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2018-12-24 13:47:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 13:47:27,127 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-12-24 13:47:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:27,128 INFO L225 Difference]: With dead ends: 88 [2018-12-24 13:47:27,128 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 13:47:27,129 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 [2018-12-24 13:47:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 13:47:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-24 13:47:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-24 13:47:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-24 13:47:27,132 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-24 13:47:27,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:27,132 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-24 13:47:27,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-24 13:47:27,132 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-24 13:47:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-24 13:47:27,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:27,133 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-24 13:47:27,133 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:27,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:27,133 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2018-12-24 13:47:27,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:27,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-24 13:47:27,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:27,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:27,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:27,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:27,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:27,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:27,534 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:27,534 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:27,576 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:27,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:27,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-24 13:47:27,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:28,646 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2018-12-24 13:47:28,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:28,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-24 13:47:28,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:28,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 13:47:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 13:47:28,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 13:47:28,667 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2018-12-24 13:47:28,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:28,791 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2018-12-24 13:47:28,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 13:47:28,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-24 13:47:28,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:28,792 INFO L225 Difference]: With dead ends: 91 [2018-12-24 13:47:28,792 INFO L226 Difference]: Without dead ends: 61 [2018-12-24 13:47:28,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-24 13:47:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-24 13:47:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-24 13:47:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:47:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-24 13:47:28,797 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-24 13:47:28,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:28,797 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-24 13:47:28,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 13:47:28,797 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-24 13:47:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 13:47:28,798 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:28,798 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-24 13:47:28,798 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2018-12-24 13:47:28,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:28,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:28,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:28,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:28,800 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 13:47:29,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:29,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:29,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:29,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:29,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:29,263 INFO 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 [2018-12-24 13:47:29,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:29,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:29,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:29,336 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 13:47:29,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:30,810 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-24 13:47:30,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:30,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-24 13:47:30,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-24 13:47:30,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-24 13:47:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 13:47:30,831 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2018-12-24 13:47:30,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:30,957 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2018-12-24 13:47:30,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 13:47:30,958 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-24 13:47:30,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:30,958 INFO L225 Difference]: With dead ends: 94 [2018-12-24 13:47:30,959 INFO L226 Difference]: Without dead ends: 63 [2018-12-24 13:47:30,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-24 13:47:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-24 13:47:30,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-24 13:47:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-24 13:47:30,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-24 13:47:30,963 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-24 13:47:30,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:30,963 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-24 13:47:30,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-24 13:47:30,964 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-24 13:47:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-24 13:47:30,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:30,964 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-24 13:47:30,964 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2018-12-24 13:47:30,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:30,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:30,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:30,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-24 13:47:31,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:31,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:31,411 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:31,411 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:31,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:31,411 INFO 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 [2018-12-24 13:47:31,419 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:31,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:31,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-24 13:47:31,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:31,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-24 13:47:31,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:32,790 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-12-24 13:47:32,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:32,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-24 13:47:32,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:32,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 13:47:32,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 13:47:32,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:32,812 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2018-12-24 13:47:32,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:32,948 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2018-12-24 13:47:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 13:47:32,949 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-24 13:47:32,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:32,950 INFO L225 Difference]: With dead ends: 97 [2018-12-24 13:47:32,950 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:47:32,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:32,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:47:32,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-24 13:47:32,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-24 13:47:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-24 13:47:32,955 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2018-12-24 13:47:32,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:32,955 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-24 13:47:32,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 13:47:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-24 13:47:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-24 13:47:32,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:32,956 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-24 13:47:32,956 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:32,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:32,956 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2018-12-24 13:47:32,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:32,957 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:32,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:32,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 13:47:33,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:33,635 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:33,635 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:33,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:33,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:33,636 INFO 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 [2018-12-24 13:47:33,645 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:33,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:33,692 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:33,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:33,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 13:47:33,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:34,785 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-24 13:47:34,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:34,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-24 13:47:34,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:34,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-24 13:47:34,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-24 13:47:34,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 13:47:34,805 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2018-12-24 13:47:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:35,003 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-24 13:47:35,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 13:47:35,003 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-24 13:47:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:35,004 INFO L225 Difference]: With dead ends: 100 [2018-12-24 13:47:35,004 INFO L226 Difference]: Without dead ends: 67 [2018-12-24 13:47:35,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-24 13:47:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-24 13:47:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-24 13:47:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 13:47:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-24 13:47:35,008 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-24 13:47:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:35,009 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-24 13:47:35,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-24 13:47:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-24 13:47:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 13:47:35,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:35,010 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-24 13:47:35,010 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:35,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2018-12-24 13:47:35,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:35,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:35,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:35,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:35,542 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-24 13:47:35,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:35,542 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:35,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:35,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:35,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:35,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:35,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:35,551 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:35,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:35,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-24 13:47:35,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2018-12-24 13:47:36,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:36,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-24 13:47:36,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:36,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 13:47:36,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 13:47:36,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-24 13:47:36,742 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2018-12-24 13:47:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:36,873 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2018-12-24 13:47:36,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 13:47:36,874 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-24 13:47:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:36,875 INFO L225 Difference]: With dead ends: 103 [2018-12-24 13:47:36,875 INFO L226 Difference]: Without dead ends: 69 [2018-12-24 13:47:36,876 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 [2018-12-24 13:47:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-24 13:47:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-24 13:47:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-24 13:47:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-24 13:47:36,879 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-24 13:47:36,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:36,879 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-24 13:47:36,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 13:47:36,879 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-24 13:47:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-24 13:47:36,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:36,880 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-24 13:47:36,880 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:36,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2018-12-24 13:47:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:38,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 13:47:38,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:38,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:38,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:38,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:38,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:38,041 INFO 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 [2018-12-24 13:47:38,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:38,050 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:38,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-24 13:47:38,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:38,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 13:47:38,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-24 13:47:39,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:39,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-24 13:47:39,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:39,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-24 13:47:39,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-24 13:47:39,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:39,512 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2018-12-24 13:47:39,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:39,658 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2018-12-24 13:47:39,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 13:47:39,659 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-12-24 13:47:39,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:39,660 INFO L225 Difference]: With dead ends: 106 [2018-12-24 13:47:39,660 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 13:47:39,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 13:47:39,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-24 13:47:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-24 13:47:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-24 13:47:39,664 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-24 13:47:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:39,665 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-24 13:47:39,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-24 13:47:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-24 13:47:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-24 13:47:39,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:39,665 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-24 13:47:39,666 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:39,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:39,666 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2018-12-24 13:47:39,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:39,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:39,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:39,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:39,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-24 13:47:40,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:40,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:40,483 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:40,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:40,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:40,484 INFO 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 [2018-12-24 13:47:40,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:40,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:40,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:40,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:40,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-24 13:47:40,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:41,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2018-12-24 13:47:41,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:41,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-24 13:47:41,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:41,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 13:47:41,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 13:47:41,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:47:41,900 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2018-12-24 13:47:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:42,095 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2018-12-24 13:47:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 13:47:42,096 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-24 13:47:42,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:42,097 INFO L225 Difference]: With dead ends: 109 [2018-12-24 13:47:42,097 INFO L226 Difference]: Without dead ends: 73 [2018-12-24 13:47:42,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-24 13:47:42,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-24 13:47:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-24 13:47:42,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:47:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-24 13:47:42,100 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2018-12-24 13:47:42,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:42,100 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-24 13:47:42,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 13:47:42,100 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-24 13:47:42,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 13:47:42,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:42,101 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-24 13:47:42,101 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:42,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:42,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2018-12-24 13:47:42,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:42,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:42,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:42,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:42,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 13:47:42,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:42,693 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:42,693 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:42,693 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:42,693 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:42,693 INFO 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 [2018-12-24 13:47:42,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:42,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:42,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:42,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 13:47:42,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:44,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-24 13:47:44,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:44,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-24 13:47:44,343 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:44,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-24 13:47:44,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-24 13:47:44,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 13:47:44,344 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2018-12-24 13:47:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:44,583 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2018-12-24 13:47:44,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 13:47:44,583 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-24 13:47:44,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:44,584 INFO L225 Difference]: With dead ends: 112 [2018-12-24 13:47:44,584 INFO L226 Difference]: Without dead ends: 75 [2018-12-24 13:47:44,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-24 13:47:44,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-24 13:47:44,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-24 13:47:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-24 13:47:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-24 13:47:44,589 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-24 13:47:44,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:44,589 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-24 13:47:44,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-24 13:47:44,589 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-24 13:47:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-24 13:47:44,590 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:44,590 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-24 13:47:44,590 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2018-12-24 13:47:44,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:44,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:44,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:44,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:44,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-24 13:47:45,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:45,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:45,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:45,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:45,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:45,288 INFO 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 [2018-12-24 13:47:45,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:45,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:45,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-24 13:47:45,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:45,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-24 13:47:45,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:47,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2018-12-24 13:47:47,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:47,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-24 13:47:47,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:47,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 13:47:47,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 13:47:47,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:47,169 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2018-12-24 13:47:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:47,312 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-24 13:47:47,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 13:47:47,312 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-24 13:47:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:47,313 INFO L225 Difference]: With dead ends: 115 [2018-12-24 13:47:47,313 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 13:47:47,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:47,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 13:47:47,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-24 13:47:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-24 13:47:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-24 13:47:47,316 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-24 13:47:47,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:47,316 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-24 13:47:47,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 13:47:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-24 13:47:47,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-24 13:47:47,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:47,317 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-24 13:47:47,317 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:47,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:47,317 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2018-12-24 13:47:47,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:47,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:47,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:47,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 13:47:47,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:47,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:47,950 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:47,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:47,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:47,950 INFO 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 [2018-12-24 13:47:47,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:47,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:48,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:48,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:48,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:48,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 13:47:48,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:49,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-24 13:47:49,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:49,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-24 13:47:49,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:49,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-24 13:47:49,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-24 13:47:49,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 13:47:49,611 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2018-12-24 13:47:49,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:49,763 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2018-12-24 13:47:49,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 13:47:49,764 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-24 13:47:49,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:49,765 INFO L225 Difference]: With dead ends: 118 [2018-12-24 13:47:49,765 INFO L226 Difference]: Without dead ends: 79 [2018-12-24 13:47:49,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-24 13:47:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-24 13:47:49,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-24 13:47:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 13:47:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-24 13:47:49,769 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-24 13:47:49,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:49,769 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-24 13:47:49,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-24 13:47:49,769 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-24 13:47:49,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 13:47:49,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:49,770 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-24 13:47:49,770 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2018-12-24 13:47:49,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:49,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:49,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:49,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:49,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:49,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-24 13:47:50,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:50,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:50,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:50,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:50,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:50,697 INFO 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 [2018-12-24 13:47:50,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:50,704 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:50,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-24 13:47:50,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:52,498 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2018-12-24 13:47:52,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:52,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-24 13:47:52,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:52,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 13:47:52,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 13:47:52,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 13:47:52,518 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2018-12-24 13:47:52,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:52,674 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2018-12-24 13:47:52,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 13:47:52,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-24 13:47:52,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:52,675 INFO L225 Difference]: With dead ends: 121 [2018-12-24 13:47:52,675 INFO L226 Difference]: Without dead ends: 81 [2018-12-24 13:47:52,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-24 13:47:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-24 13:47:52,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-24 13:47:52,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-24 13:47:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-24 13:47:52,679 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-12-24 13:47:52,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:52,680 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-24 13:47:52,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 13:47:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-24 13:47:52,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-24 13:47:52,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:52,680 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-24 13:47:52,681 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:52,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2018-12-24 13:47:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:52,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:52,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:52,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:53,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 13:47:53,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:53,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:53,907 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:53,907 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:53,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:53,907 INFO 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 [2018-12-24 13:47:53,915 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:53,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:54,324 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-24 13:47:54,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:54,330 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 13:47:54,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:56,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-24 13:47:56,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:56,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-24 13:47:56,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:56,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-24 13:47:56,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-24 13:47:56,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:56,410 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2018-12-24 13:47:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:56,562 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2018-12-24 13:47:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 13:47:56,563 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-12-24 13:47:56,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:56,564 INFO L225 Difference]: With dead ends: 124 [2018-12-24 13:47:56,564 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 13:47:56,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:56,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 13:47:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-24 13:47:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-24 13:47:56,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-24 13:47:56,568 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-24 13:47:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:56,568 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-24 13:47:56,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-24 13:47:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-24 13:47:56,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-24 13:47:56,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:56,568 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-24 13:47:56,569 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:56,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:56,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2018-12-24 13:47:56,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:56,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:56,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:56,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:56,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:57,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-24 13:47:57,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:57,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:57,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:57,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:57,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:57,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:47:57,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:57,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:57,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:57,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:57,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:57,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-24 13:47:57,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:59,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2018-12-24 13:47:59,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:59,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-24 13:47:59,669 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:59,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 13:47:59,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 13:47:59,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 13:47:59,671 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2018-12-24 13:47:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:59,822 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2018-12-24 13:47:59,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 13:47:59,822 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-24 13:47:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:59,823 INFO L225 Difference]: With dead ends: 127 [2018-12-24 13:47:59,823 INFO L226 Difference]: Without dead ends: 85 [2018-12-24 13:47:59,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-24 13:47:59,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-24 13:47:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-24 13:47:59,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 13:47:59,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-24 13:47:59,826 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-24 13:47:59,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:59,826 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-24 13:47:59,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 13:47:59,826 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-24 13:47:59,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 13:47:59,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:59,826 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-24 13:47:59,827 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:59,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:59,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2018-12-24 13:47:59,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:59,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:59,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:59,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 13:48:00,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:00,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:00,824 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:00,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:00,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:00,824 INFO 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 [2018-12-24 13:48:00,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:00,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:00,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 13:48:00,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:02,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-24 13:48:02,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:02,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-24 13:48:02,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:02,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-24 13:48:02,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-24 13:48:02,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 13:48:02,688 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2018-12-24 13:48:02,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:02,859 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-24 13:48:02,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 13:48:02,859 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-24 13:48:02,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:02,860 INFO L225 Difference]: With dead ends: 130 [2018-12-24 13:48:02,860 INFO L226 Difference]: Without dead ends: 87 [2018-12-24 13:48:02,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-24 13:48:02,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-24 13:48:02,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-24 13:48:02,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-24 13:48:02,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-24 13:48:02,863 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-24 13:48:02,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:02,864 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-24 13:48:02,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-24 13:48:02,864 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-24 13:48:02,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-24 13:48:02,864 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:02,865 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-24 13:48:02,865 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:02,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:02,865 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2018-12-24 13:48:02,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:02,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:02,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:02,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:03,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-24 13:48:03,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:03,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:03,842 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:03,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:03,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:03,842 INFO 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 [2018-12-24 13:48:03,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:03,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:04,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-24 13:48:04,198 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:04,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:04,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-24 13:48:04,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:06,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2018-12-24 13:48:06,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:06,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-24 13:48:06,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:06,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 13:48:06,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 13:48:06,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:48:06,304 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2018-12-24 13:48:06,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:06,481 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-24 13:48:06,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 13:48:06,481 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-24 13:48:06,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:06,482 INFO L225 Difference]: With dead ends: 133 [2018-12-24 13:48:06,482 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 13:48:06,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:48:06,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 13:48:06,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-24 13:48:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-24 13:48:06,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-24 13:48:06,486 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2018-12-24 13:48:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:06,486 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-24 13:48:06,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 13:48:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-24 13:48:06,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-24 13:48:06,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:06,487 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-24 13:48:06,488 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2018-12-24 13:48:06,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:06,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:06,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:06,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:07,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 13:48:07,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:07,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:07,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:07,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:07,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:07,277 INFO 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 [2018-12-24 13:48:07,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:07,285 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:07,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:07,350 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:07,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 13:48:07,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-24 13:48:09,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:09,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-24 13:48:09,830 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:09,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-24 13:48:09,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-24 13:48:09,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 13:48:09,832 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2018-12-24 13:48:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:10,004 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2018-12-24 13:48:10,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 13:48:10,005 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-24 13:48:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:10,006 INFO L225 Difference]: With dead ends: 136 [2018-12-24 13:48:10,006 INFO L226 Difference]: Without dead ends: 91 [2018-12-24 13:48:10,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-24 13:48:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-24 13:48:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-24 13:48:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 13:48:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-24 13:48:10,009 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-24 13:48:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:10,009 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-24 13:48:10,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-24 13:48:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-24 13:48:10,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 13:48:10,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:10,010 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-24 13:48:10,010 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:10,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:10,011 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2018-12-24 13:48:10,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:10,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:10,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:10,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:10,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-24 13:48:12,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:12,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:12,401 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:12,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:12,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:12,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:12,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:12,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:12,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-24 13:48:12,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:14,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2018-12-24 13:48:14,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:14,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-24 13:48:14,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:14,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 13:48:14,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 13:48:14,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 13:48:14,630 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2018-12-24 13:48:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:14,886 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2018-12-24 13:48:14,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 13:48:14,886 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-24 13:48:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:14,887 INFO L225 Difference]: With dead ends: 139 [2018-12-24 13:48:14,887 INFO L226 Difference]: Without dead ends: 93 [2018-12-24 13:48:14,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-24 13:48:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-24 13:48:14,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-24 13:48:14,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-24 13:48:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-24 13:48:14,890 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-24 13:48:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:14,890 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-24 13:48:14,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 13:48:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-24 13:48:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-24 13:48:14,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:14,891 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-24 13:48:14,891 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:14,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2018-12-24 13:48:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:14,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:14,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:14,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:14,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:14,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 13:48:15,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:15,945 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:15,945 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:15,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:15,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:15,945 INFO 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 [2018-12-24 13:48:15,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:15,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:16,348 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-24 13:48:16,348 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:16,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 13:48:16,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:18,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-24 13:48:18,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:18,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-24 13:48:18,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:18,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-24 13:48:18,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-24 13:48:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:18,607 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2018-12-24 13:48:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:19,827 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2018-12-24 13:48:19,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 13:48:19,828 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-12-24 13:48:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:19,829 INFO L225 Difference]: With dead ends: 142 [2018-12-24 13:48:19,829 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 13:48:19,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:19,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 13:48:19,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-24 13:48:19,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-24 13:48:19,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-24 13:48:19,832 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-24 13:48:19,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:19,833 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-24 13:48:19,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-24 13:48:19,833 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-24 13:48:19,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-24 13:48:19,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:19,833 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-24 13:48:19,834 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:19,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:19,834 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2018-12-24 13:48:19,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:19,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:19,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:19,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:19,835 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-24 13:48:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:20,804 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:20,804 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:20,804 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:20,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:20,804 INFO 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 [2018-12-24 13:48:20,812 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:20,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:20,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:20,880 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:20,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-24 13:48:20,901 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:24,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2018-12-24 13:48:24,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:24,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-24 13:48:24,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:24,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 13:48:24,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 13:48:24,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:48:24,439 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2018-12-24 13:48:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:24,666 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-24 13:48:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 13:48:24,674 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-24 13:48:24,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:24,675 INFO L225 Difference]: With dead ends: 145 [2018-12-24 13:48:24,675 INFO L226 Difference]: Without dead ends: 97 [2018-12-24 13:48:24,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-24 13:48:24,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-24 13:48:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-24 13:48:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:48:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-24 13:48:24,679 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-12-24 13:48:24,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:24,679 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-24 13:48:24,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 13:48:24,679 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-24 13:48:24,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 13:48:24,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:24,680 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-24 13:48:24,680 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:24,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:24,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2018-12-24 13:48:24,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:24,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:24,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:25,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 13:48:25,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:25,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:25,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:25,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:25,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:25,813 INFO 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 [2018-12-24 13:48:25,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:25,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:25,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:25,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 13:48:25,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:28,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-24 13:48:28,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:28,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-24 13:48:28,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:28,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-24 13:48:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-24 13:48:28,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 13:48:28,637 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2018-12-24 13:48:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:28,812 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-12-24 13:48:28,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 13:48:28,812 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-24 13:48:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:28,813 INFO L225 Difference]: With dead ends: 148 [2018-12-24 13:48:28,813 INFO L226 Difference]: Without dead ends: 99 [2018-12-24 13:48:28,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-24 13:48:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-24 13:48:28,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-24 13:48:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-24 13:48:28,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-24 13:48:28,817 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-24 13:48:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:28,817 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-24 13:48:28,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-24 13:48:28,818 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-24 13:48:28,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-24 13:48:28,818 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:28,818 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-24 13:48:28,819 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:28,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:28,819 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2018-12-24 13:48:28,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:28,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:28,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:28,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:28,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-24 13:48:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:30,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:30,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:30,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:30,403 INFO 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 [2018-12-24 13:48:30,411 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:30,412 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:30,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-24 13:48:30,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:30,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:30,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-24 13:48:30,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2018-12-24 13:48:33,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:33,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-24 13:48:33,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:33,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 13:48:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 13:48:33,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:33,897 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2018-12-24 13:48:34,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:34,087 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2018-12-24 13:48:34,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 13:48:34,087 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-24 13:48:34,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:34,088 INFO L225 Difference]: With dead ends: 151 [2018-12-24 13:48:34,088 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 13:48:34,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 13:48:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-24 13:48:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-24 13:48:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-24 13:48:34,092 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-24 13:48:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:34,092 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-24 13:48:34,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 13:48:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-24 13:48:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-24 13:48:34,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:34,093 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-24 13:48:34,093 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2018-12-24 13:48:34,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:34,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:34,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:34,095 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:35,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 13:48:35,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:35,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:35,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:35,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:35,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:35,143 INFO 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 [2018-12-24 13:48:35,150 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:35,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:35,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:35,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:35,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 13:48:35,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-24 13:48:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-24 13:48:38,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:38,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-24 13:48:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-24 13:48:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 13:48:38,071 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2018-12-24 13:48:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:38,351 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2018-12-24 13:48:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 13:48:38,352 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-24 13:48:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:38,352 INFO L225 Difference]: With dead ends: 154 [2018-12-24 13:48:38,352 INFO L226 Difference]: Without dead ends: 103 [2018-12-24 13:48:38,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-24 13:48:38,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-24 13:48:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-24 13:48:38,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 13:48:38,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-24 13:48:38,356 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-24 13:48:38,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:38,356 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-24 13:48:38,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-24 13:48:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-24 13:48:38,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 13:48:38,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:38,357 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-24 13:48:38,357 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:38,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:38,357 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2018-12-24 13:48:38,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:38,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:38,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:39,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-24 13:48:39,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:39,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:39,417 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:39,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:39,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:39,417 INFO 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 [2018-12-24 13:48:39,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:39,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:39,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-24 13:48:39,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:42,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2018-12-24 13:48:42,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:42,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-24 13:48:42,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:42,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 13:48:42,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 13:48:42,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 13:48:42,641 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2018-12-24 13:48:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:42,884 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2018-12-24 13:48:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 13:48:42,885 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-24 13:48:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:42,885 INFO L225 Difference]: With dead ends: 157 [2018-12-24 13:48:42,885 INFO L226 Difference]: Without dead ends: 105 [2018-12-24 13:48:42,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-24 13:48:42,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-24 13:48:42,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-24 13:48:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-24 13:48:42,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-24 13:48:42,889 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2018-12-24 13:48:42,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:42,889 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-24 13:48:42,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 13:48:42,889 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-24 13:48:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-24 13:48:42,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:42,890 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-24 13:48:42,890 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2018-12-24 13:48:42,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:42,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:42,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:42,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:42,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:42,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 13:48:43,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:43,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:43,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:43,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:43,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:43,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:48:43,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:43,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:45,231 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-24 13:48:45,232 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:45,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 13:48:45,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-24 13:48:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:48,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-24 13:48:48,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:48,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-24 13:48:48,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-24 13:48:48,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:48,610 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2018-12-24 13:48:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:49,581 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-24 13:48:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 13:48:49,581 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-12-24 13:48:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:49,582 INFO L225 Difference]: With dead ends: 160 [2018-12-24 13:48:49,582 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 13:48:49,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 13:48:49,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-24 13:48:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-24 13:48:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-24 13:48:49,586 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-24 13:48:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:49,586 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-24 13:48:49,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-24 13:48:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-24 13:48:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-24 13:48:49,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:49,587 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-24 13:48:49,587 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:49,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:49,588 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2018-12-24 13:48:49,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:49,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:49,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:49,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:49,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:49,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-24 13:48:50,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:50,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:50,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:50,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:50,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:50,857 INFO 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 [2018-12-24 13:48:50,868 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:50,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:50,940 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:50,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:50,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:50,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-24 13:48:50,959 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2018-12-24 13:48:54,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:54,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-24 13:48:54,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:54,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 13:48:54,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 13:48:54,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 13:48:54,182 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2018-12-24 13:48:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:54,421 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2018-12-24 13:48:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 13:48:54,421 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-24 13:48:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:54,422 INFO L225 Difference]: With dead ends: 163 [2018-12-24 13:48:54,422 INFO L226 Difference]: Without dead ends: 109 [2018-12-24 13:48:54,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-24 13:48:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-24 13:48:54,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-24 13:48:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 13:48:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-24 13:48:54,426 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-24 13:48:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:54,426 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-24 13:48:54,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 13:48:54,426 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-24 13:48:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 13:48:54,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:54,427 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-24 13:48:54,427 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:54,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:54,428 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2018-12-24 13:48:54,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:54,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:54,429 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:54,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:54,429 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:54,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:55,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 13:48:55,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:55,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:55,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:55,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:55,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:55,901 INFO 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 [2018-12-24 13:48:55,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:55,910 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:55,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:55,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 13:48:56,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-24 13:48:59,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:59,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-24 13:48:59,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:59,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-24 13:48:59,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-24 13:48:59,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 13:48:59,347 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2018-12-24 13:48:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:59,590 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2018-12-24 13:48:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 13:48:59,591 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-24 13:48:59,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:59,591 INFO L225 Difference]: With dead ends: 166 [2018-12-24 13:48:59,591 INFO L226 Difference]: Without dead ends: 111 [2018-12-24 13:48:59,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-24 13:48:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-24 13:48:59,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-24 13:48:59,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-24 13:48:59,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-24 13:48:59,594 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-24 13:48:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:59,595 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-24 13:48:59,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-24 13:48:59,595 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-24 13:48:59,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-24 13:48:59,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:59,595 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-24 13:48:59,596 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:59,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2018-12-24 13:48:59,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:59,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:59,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:59,597 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:00,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-24 13:49:00,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:00,754 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:00,754 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:00,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:00,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:00,754 INFO 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 [2018-12-24 13:49:00,763 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:00,763 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:02,058 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-24 13:49:02,058 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:02,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-24 13:49:02,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:05,387 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2018-12-24 13:49:05,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:05,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-24 13:49:05,408 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:05,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 13:49:05,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 13:49:05,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:49:05,409 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 56 states. [2018-12-24 13:49:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:05,687 INFO L93 Difference]: Finished difference Result 169 states and 172 transitions. [2018-12-24 13:49:05,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 13:49:05,687 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-24 13:49:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:05,688 INFO L225 Difference]: With dead ends: 169 [2018-12-24 13:49:05,688 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 13:49:05,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:49:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 13:49:05,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-24 13:49:05,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-24 13:49:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-24 13:49:05,691 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-12-24 13:49:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:05,691 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-24 13:49:05,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 13:49:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-24 13:49:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-24 13:49:05,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:05,692 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-24 13:49:05,693 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:05,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:05,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 54 times [2018-12-24 13:49:05,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:05,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:05,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:05,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-24 13:49:08,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:08,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:08,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:08,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:08,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:08,268 INFO 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 [2018-12-24 13:49:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:08,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:08,354 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:08,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:08,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:08,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-24 13:49:08,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-24 13:49:11,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:11,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-24 13:49:11,607 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:11,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-24 13:49:11,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-24 13:49:11,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 13:49:11,609 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 57 states. [2018-12-24 13:49:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:11,850 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-12-24 13:49:11,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 13:49:11,850 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-24 13:49:11,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:11,851 INFO L225 Difference]: With dead ends: 172 [2018-12-24 13:49:11,852 INFO L226 Difference]: Without dead ends: 115 [2018-12-24 13:49:11,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-24 13:49:11,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-24 13:49:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-24 13:49:11,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-24 13:49:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-24 13:49:11,856 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-24 13:49:11,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:11,856 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-24 13:49:11,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-24 13:49:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-24 13:49:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-24 13:49:11,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:11,857 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1] [2018-12-24 13:49:11,857 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:11,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:11,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1244388821, now seen corresponding path program 55 times [2018-12-24 13:49:11,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:11,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:11,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:11,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:11,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:13,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-24 13:49:13,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:13,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:13,503 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:13,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:13,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:13,503 INFO 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 [2018-12-24 13:49:13,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:13,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:13,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:13,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:13,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-24 13:49:13,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:17,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2018-12-24 13:49:17,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:17,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-24 13:49:17,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:17,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 13:49:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 13:49:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 13:49:17,081 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 58 states. [2018-12-24 13:49:17,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:17,620 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-24 13:49:17,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 13:49:17,621 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-24 13:49:17,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:17,621 INFO L225 Difference]: With dead ends: 175 [2018-12-24 13:49:17,621 INFO L226 Difference]: Without dead ends: 117 [2018-12-24 13:49:17,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-24 13:49:17,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-24 13:49:17,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-24 13:49:17,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-24 13:49:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-24 13:49:17,626 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-24 13:49:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:17,626 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-24 13:49:17,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 13:49:17,626 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-24 13:49:17,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-24 13:49:17,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:17,627 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1] [2018-12-24 13:49:17,627 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:17,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:17,628 INFO L82 PathProgramCache]: Analyzing trace with hash -464518326, now seen corresponding path program 56 times [2018-12-24 13:49:17,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:17,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:17,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:17,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:17,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-24 13:49:18,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:18,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:18,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:18,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:18,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:18,890 INFO 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 [2018-12-24 13:49:18,899 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:18,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:19,840 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-24 13:49:19,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:19,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:19,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-24 13:49:19,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 1596 trivial. 0 not checked. [2018-12-24 13:49:23,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:23,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-24 13:49:23,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:23,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-24 13:49:23,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-24 13:49:23,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:49:23,765 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 59 states. [2018-12-24 13:49:24,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:24,116 INFO L93 Difference]: Finished difference Result 178 states and 181 transitions. [2018-12-24 13:49:24,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 13:49:24,116 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-12-24 13:49:24,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:24,117 INFO L225 Difference]: With dead ends: 178 [2018-12-24 13:49:24,117 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 13:49:24,118 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 [2018-12-24 13:49:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 13:49:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-24 13:49:24,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-24 13:49:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-12-24 13:49:24,120 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 116 [2018-12-24 13:49:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:24,120 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-12-24 13:49:24,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-24 13:49:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-12-24 13:49:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-24 13:49:24,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:24,121 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1] [2018-12-24 13:49:24,122 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:24,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:24,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1327912501, now seen corresponding path program 57 times [2018-12-24 13:49:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:24,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:24,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:24,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:25,494 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-24 13:49:25,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:25,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:25,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:25,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:25,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:25,495 INFO 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 [2018-12-24 13:49:25,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:25,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:25,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:25,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:25,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:25,611 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-24 13:49:25,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2018-12-24 13:49:29,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:29,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-24 13:49:29,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:29,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 13:49:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 13:49:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:49:29,506 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 60 states. [2018-12-24 13:49:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:29,814 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2018-12-24 13:49:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 13:49:29,814 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-24 13:49:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:29,815 INFO L225 Difference]: With dead ends: 181 [2018-12-24 13:49:29,815 INFO L226 Difference]: Without dead ends: 121 [2018-12-24 13:49:29,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-24 13:49:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-24 13:49:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-24 13:49:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 13:49:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-24 13:49:29,820 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 118 [2018-12-24 13:49:29,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:29,820 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-24 13:49:29,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 13:49:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-24 13:49:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 13:49:29,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:29,821 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1] [2018-12-24 13:49:29,821 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:29,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1186678166, now seen corresponding path program 58 times [2018-12-24 13:49:29,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:29,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:29,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:29,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-24 13:49:31,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:31,183 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:31,183 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:31,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:31,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:31,183 INFO 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 [2018-12-24 13:49:31,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:31,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:31,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-24 13:49:31,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:35,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2018-12-24 13:49:35,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:35,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-24 13:49:35,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:35,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-24 13:49:35,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-24 13:49:35,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 13:49:35,213 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 61 states. [2018-12-24 13:49:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:35,599 INFO L93 Difference]: Finished difference Result 184 states and 187 transitions. [2018-12-24 13:49:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 13:49:35,599 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-24 13:49:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:35,600 INFO L225 Difference]: With dead ends: 184 [2018-12-24 13:49:35,600 INFO L226 Difference]: Without dead ends: 123 [2018-12-24 13:49:35,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-24 13:49:35,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-24 13:49:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-24 13:49:35,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-24 13:49:35,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-24 13:49:35,604 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-24 13:49:35,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:35,604 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-24 13:49:35,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-24 13:49:35,604 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-24 13:49:35,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-24 13:49:35,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:35,605 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1] [2018-12-24 13:49:35,606 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:35,606 INFO L82 PathProgramCache]: Analyzing trace with hash 737003157, now seen corresponding path program 59 times [2018-12-24 13:49:35,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:35,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:35,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:35,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-24 13:49:36,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:36,971 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:36,971 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:36,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:36,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:36,971 INFO 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 [2018-12-24 13:49:36,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:36,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:38,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-24 13:49:38,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:38,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-24 13:49:38,113 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:42,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2018-12-24 13:49:42,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:42,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-24 13:49:42,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:42,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 13:49:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 13:49:42,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:49:42,120 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 62 states. [2018-12-24 13:49:42,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:42,473 INFO L93 Difference]: Finished difference Result 187 states and 190 transitions. [2018-12-24 13:49:42,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 13:49:42,473 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-24 13:49:42,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:42,474 INFO L225 Difference]: With dead ends: 187 [2018-12-24 13:49:42,474 INFO L226 Difference]: Without dead ends: 125 [2018-12-24 13:49:42,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:49:42,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-24 13:49:42,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-24 13:49:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-24 13:49:42,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-24 13:49:42,479 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-24 13:49:42,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:42,479 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-24 13:49:42,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 13:49:42,479 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-24 13:49:42,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-24 13:49:42,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:42,480 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1] [2018-12-24 13:49:42,480 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:42,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:42,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1414379914, now seen corresponding path program 60 times [2018-12-24 13:49:42,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:42,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:42,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-24 13:49:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:44,368 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:44,368 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:44,368 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:44,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:44,368 INFO 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 [2018-12-24 13:49:44,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:44,378 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:44,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:44,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:44,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-24 13:49:44,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 1830 trivial. 0 not checked. [2018-12-24 13:49:48,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:48,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-24 13:49:48,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:48,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-24 13:49:48,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-24 13:49:48,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 13:49:48,745 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 63 states. [2018-12-24 13:49:49,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:49,031 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-24 13:49:49,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 13:49:49,032 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-24 13:49:49,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:49,033 INFO L225 Difference]: With dead ends: 190 [2018-12-24 13:49:49,033 INFO L226 Difference]: Without dead ends: 127 [2018-12-24 13:49:49,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-24 13:49:49,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-24 13:49:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-24 13:49:49,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-24 13:49:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-12-24 13:49:49,037 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 124 [2018-12-24 13:49:49,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:49,037 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-12-24 13:49:49,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-24 13:49:49,037 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-12-24 13:49:49,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-24 13:49:49,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:49,038 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1] [2018-12-24 13:49:49,038 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:49,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:49,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1579405579, now seen corresponding path program 61 times [2018-12-24 13:49:49,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:49,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:49,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:49,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-24 13:49:50,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:50,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:50,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:50,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:50,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:50,485 INFO 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 [2018-12-24 13:49:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:50,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:50,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-24 13:49:50,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:55,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2018-12-24 13:49:55,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:55,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-24 13:49:55,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:55,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 13:49:55,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 13:49:55,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 13:49:55,025 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 64 states. [2018-12-24 13:49:55,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:55,411 INFO L93 Difference]: Finished difference Result 193 states and 196 transitions. [2018-12-24 13:49:55,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 13:49:55,412 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-24 13:49:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:55,412 INFO L225 Difference]: With dead ends: 193 [2018-12-24 13:49:55,413 INFO L226 Difference]: Without dead ends: 129 [2018-12-24 13:49:55,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-24 13:49:55,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-24 13:49:55,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-24 13:49:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-24 13:49:55,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-24 13:49:55,416 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-12-24 13:49:55,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:55,416 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-24 13:49:55,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 13:49:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-24 13:49:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-24 13:49:55,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:55,417 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1] [2018-12-24 13:49:55,417 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1271856982, now seen corresponding path program 62 times [2018-12-24 13:49:55,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:55,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:55,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:55,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:55,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:56,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-24 13:49:56,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:56,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:56,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:56,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:56,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:56,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:49:56,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:56,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:58,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-24 13:49:58,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:58,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-24 13:49:58,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 1953 trivial. 0 not checked. [2018-12-24 13:50:02,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:02,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-24 13:50:02,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:02,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-24 13:50:02,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-24 13:50:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:50:02,577 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 65 states. [2018-12-24 13:50:03,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:03,006 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2018-12-24 13:50:03,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 13:50:03,006 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-24 13:50:03,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:03,007 INFO L225 Difference]: With dead ends: 196 [2018-12-24 13:50:03,007 INFO L226 Difference]: Without dead ends: 131 [2018-12-24 13:50:03,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:50:03,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-24 13:50:03,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-24 13:50:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-24 13:50:03,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-24 13:50:03,012 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-24 13:50:03,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:03,012 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-24 13:50:03,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-24 13:50:03,012 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-24 13:50:03,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-24 13:50:03,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:03,013 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1] [2018-12-24 13:50:03,013 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:03,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:03,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1741393749, now seen corresponding path program 63 times [2018-12-24 13:50:03,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:03,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:03,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:03,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-24 13:50:04,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:04,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:04,903 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:04,904 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:04,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:04,904 INFO 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 [2018-12-24 13:50:04,916 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:04,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:05,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:05,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:05,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-24 13:50:05,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:09,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-12-24 13:50:09,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:09,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-24 13:50:09,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:09,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 13:50:09,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 13:50:09,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 13:50:09,655 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 66 states. [2018-12-24 13:50:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:10,072 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-12-24 13:50:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 13:50:10,073 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-24 13:50:10,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:10,073 INFO L225 Difference]: With dead ends: 199 [2018-12-24 13:50:10,073 INFO L226 Difference]: Without dead ends: 133 [2018-12-24 13:50:10,074 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-24 13:50:10,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-24 13:50:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-24 13:50:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 13:50:10,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-24 13:50:10,077 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-24 13:50:10,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:10,078 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-24 13:50:10,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 13:50:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-24 13:50:10,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-24 13:50:10,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:10,079 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1] [2018-12-24 13:50:10,079 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:10,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:10,079 INFO L82 PathProgramCache]: Analyzing trace with hash 573870026, now seen corresponding path program 64 times [2018-12-24 13:50:10,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:10,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:10,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:10,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-24 13:50:11,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:11,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:11,684 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:11,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:11,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:11,684 INFO 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 [2018-12-24 13:50:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:11,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:11,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:11,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-24 13:50:11,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:17,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 2080 trivial. 0 not checked. [2018-12-24 13:50:17,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:17,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-24 13:50:17,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:17,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-24 13:50:17,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-24 13:50:17,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 13:50:17,218 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 67 states. [2018-12-24 13:50:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:17,683 INFO L93 Difference]: Finished difference Result 202 states and 205 transitions. [2018-12-24 13:50:17,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 13:50:17,683 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-24 13:50:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:17,684 INFO L225 Difference]: With dead ends: 202 [2018-12-24 13:50:17,684 INFO L226 Difference]: Without dead ends: 135 [2018-12-24 13:50:17,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-24 13:50:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-24 13:50:17,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-24 13:50:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-24 13:50:17,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-12-24 13:50:17,689 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-12-24 13:50:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:17,689 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-12-24 13:50:17,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-24 13:50:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-12-24 13:50:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-24 13:50:17,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:17,690 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1] [2018-12-24 13:50:17,690 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash -904534091, now seen corresponding path program 65 times [2018-12-24 13:50:17,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:17,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:17,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:17,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:19,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-24 13:50:19,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:19,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:19,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:19,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:19,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:19,627 INFO 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 [2018-12-24 13:50:19,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:19,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:23,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-24 13:50:23,133 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:23,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-24 13:50:23,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:28,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2018-12-24 13:50:28,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:28,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-24 13:50:28,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:28,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 13:50:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 13:50:28,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:50:28,103 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 68 states. [2018-12-24 13:50:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:28,479 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-24 13:50:28,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 13:50:28,479 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-24 13:50:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:28,480 INFO L225 Difference]: With dead ends: 205 [2018-12-24 13:50:28,480 INFO L226 Difference]: Without dead ends: 137 [2018-12-24 13:50:28,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:50:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-24 13:50:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-24 13:50:28,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-24 13:50:28,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-24 13:50:28,483 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 134 [2018-12-24 13:50:28,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:28,483 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-24 13:50:28,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 13:50:28,483 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-24 13:50:28,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-24 13:50:28,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:28,484 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1] [2018-12-24 13:50:28,484 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:28,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1843501334, now seen corresponding path program 66 times [2018-12-24 13:50:28,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:28,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:28,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:28,486 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-24 13:50:30,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:30,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:30,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:30,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:30,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:30,803 INFO 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 [2018-12-24 13:50:30,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:30,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:30,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:30,908 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:30,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-24 13:50:30,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2018-12-24 13:50:36,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:36,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-24 13:50:36,003 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:36,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-24 13:50:36,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-24 13:50:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 13:50:36,005 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 69 states. [2018-12-24 13:50:36,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:36,509 INFO L93 Difference]: Finished difference Result 208 states and 211 transitions. [2018-12-24 13:50:36,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 13:50:36,509 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-24 13:50:36,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:36,510 INFO L225 Difference]: With dead ends: 208 [2018-12-24 13:50:36,510 INFO L226 Difference]: Without dead ends: 139 [2018-12-24 13:50:36,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-24 13:50:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-24 13:50:36,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-24 13:50:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-24 13:50:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-24 13:50:36,514 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-24 13:50:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:36,515 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-24 13:50:36,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-24 13:50:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-24 13:50:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-24 13:50:36,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:36,516 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1] [2018-12-24 13:50:36,516 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:36,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1251293205, now seen corresponding path program 67 times [2018-12-24 13:50:36,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:36,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:36,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:36,517 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-24 13:50:38,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:38,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:38,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:38,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:38,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:38,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:50:38,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:38,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:38,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:38,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-24 13:50:38,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 2278 trivial. 0 not checked. [2018-12-24 13:50:43,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:43,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-24 13:50:43,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:43,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 13:50:43,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 13:50:43,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 13:50:43,557 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 70 states. [2018-12-24 13:50:44,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:44,055 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-12-24 13:50:44,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 13:50:44,056 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-24 13:50:44,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:44,056 INFO L225 Difference]: With dead ends: 211 [2018-12-24 13:50:44,056 INFO L226 Difference]: Without dead ends: 141 [2018-12-24 13:50:44,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-24 13:50:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-24 13:50:44,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-24 13:50:44,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-24 13:50:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-24 13:50:44,061 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-24 13:50:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:44,061 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-24 13:50:44,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 13:50:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-24 13:50:44,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-24 13:50:44,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:44,062 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1] [2018-12-24 13:50:44,063 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:44,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:44,063 INFO L82 PathProgramCache]: Analyzing trace with hash 36996618, now seen corresponding path program 68 times [2018-12-24 13:50:44,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:44,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:44,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:44,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-24 13:50:46,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:46,128 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:46,128 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:46,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:46,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:46,128 INFO 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 [2018-12-24 13:50:46,138 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:46,138 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:49,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-24 13:50:49,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:49,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-24 13:50:49,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 2346 trivial. 0 not checked. [2018-12-24 13:50:55,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:55,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-24 13:50:55,266 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:55,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-24 13:50:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-24 13:50:55,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:50:55,267 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 71 states. [2018-12-24 13:50:55,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:55,796 INFO L93 Difference]: Finished difference Result 214 states and 217 transitions. [2018-12-24 13:50:55,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 13:50:55,796 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-12-24 13:50:55,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:55,797 INFO L225 Difference]: With dead ends: 214 [2018-12-24 13:50:55,797 INFO L226 Difference]: Without dead ends: 143 [2018-12-24 13:50:55,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:50:55,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-24 13:50:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-24 13:50:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-24 13:50:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-12-24 13:50:55,800 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-12-24 13:50:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:55,800 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-12-24 13:50:55,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-24 13:50:55,800 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-12-24 13:50:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-24 13:50:55,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:55,801 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1] [2018-12-24 13:50:55,801 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:55,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:55,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1084457077, now seen corresponding path program 69 times [2018-12-24 13:50:55,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:55,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:55,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:55,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:57,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-24 13:50:57,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:57,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:57,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:57,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:57,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:57,573 INFO 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 [2018-12-24 13:50:57,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:57,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:57,681 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:57,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:57,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-24 13:50:57,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:03,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 2415 trivial. 0 not checked. [2018-12-24 13:51:03,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:03,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-24 13:51:03,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:03,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 13:51:03,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 13:51:03,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:51:03,109 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 72 states. [2018-12-24 13:51:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:03,678 INFO L93 Difference]: Finished difference Result 217 states and 220 transitions. [2018-12-24 13:51:03,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 13:51:03,678 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-24 13:51:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:03,679 INFO L225 Difference]: With dead ends: 217 [2018-12-24 13:51:03,679 INFO L226 Difference]: Without dead ends: 145 [2018-12-24 13:51:03,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-24 13:51:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-24 13:51:03,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-24 13:51:03,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-24 13:51:03,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-24 13:51:03,682 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 142 [2018-12-24 13:51:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:03,682 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-24 13:51:03,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 13:51:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-24 13:51:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-24 13:51:03,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:03,683 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1] [2018-12-24 13:51:03,683 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:03,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash -616764118, now seen corresponding path program 70 times [2018-12-24 13:51:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:03,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:03,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:06,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-24 13:51:06,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:06,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:06,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:06,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:06,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:06,063 INFO 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 [2018-12-24 13:51:06,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:06,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:06,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:06,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:06,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-24 13:51:06,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:11,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 2485 trivial. 0 not checked. [2018-12-24 13:51:11,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:11,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-24 13:51:11,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:11,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-24 13:51:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-24 13:51:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 13:51:11,813 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 73 states. [2018-12-24 13:51:12,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:12,247 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-24 13:51:12,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 13:51:12,248 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-24 13:51:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:12,248 INFO L225 Difference]: With dead ends: 220 [2018-12-24 13:51:12,248 INFO L226 Difference]: Without dead ends: 147 [2018-12-24 13:51:12,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-24 13:51:12,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-24 13:51:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-24 13:51:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-24 13:51:12,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-24 13:51:12,253 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-24 13:51:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:12,253 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-24 13:51:12,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-24 13:51:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-24 13:51:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-24 13:51:12,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:12,254 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1] [2018-12-24 13:51:12,255 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:12,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:12,255 INFO L82 PathProgramCache]: Analyzing trace with hash 2031796437, now seen corresponding path program 71 times [2018-12-24 13:51:12,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:12,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:12,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:12,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:12,256 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:12,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-24 13:51:14,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:14,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:14,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:14,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:14,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:14,151 INFO 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 [2018-12-24 13:51:14,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:14,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:17,243 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-24 13:51:17,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:17,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-24 13:51:17,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 2556 trivial. 0 not checked. [2018-12-24 13:51:23,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:23,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-24 13:51:23,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:23,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 13:51:23,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 13:51:23,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:51:23,016 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 74 states. [2018-12-24 13:51:23,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:23,625 INFO L93 Difference]: Finished difference Result 223 states and 226 transitions. [2018-12-24 13:51:23,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 13:51:23,626 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-24 13:51:23,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:23,626 INFO L225 Difference]: With dead ends: 223 [2018-12-24 13:51:23,626 INFO L226 Difference]: Without dead ends: 149 [2018-12-24 13:51:23,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:51:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-24 13:51:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-24 13:51:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-24 13:51:23,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-24 13:51:23,631 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-24 13:51:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:23,631 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-24 13:51:23,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 13:51:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-24 13:51:23,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-24 13:51:23,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:23,632 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1] [2018-12-24 13:51:23,632 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:23,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:23,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1350409290, now seen corresponding path program 72 times [2018-12-24 13:51:23,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:23,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,634 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:23,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:23,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:25,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-24 13:51:25,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:25,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:25,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:25,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:25,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:25,766 INFO 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 [2018-12-24 13:51:25,774 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:25,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:25,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:25,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:25,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-24 13:51:25,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:31,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 2628 trivial. 0 not checked. [2018-12-24 13:51:31,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:31,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-24 13:51:31,877 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:31,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-24 13:51:31,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-24 13:51:31,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 13:51:31,879 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 75 states. [2018-12-24 13:51:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:32,433 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-12-24 13:51:32,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 13:51:32,434 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-24 13:51:32,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:32,434 INFO L225 Difference]: With dead ends: 226 [2018-12-24 13:51:32,434 INFO L226 Difference]: Without dead ends: 151 [2018-12-24 13:51:32,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-24 13:51:32,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-24 13:51:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-24 13:51:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-24 13:51:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2018-12-24 13:51:32,439 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 148 [2018-12-24 13:51:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:32,439 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2018-12-24 13:51:32,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-24 13:51:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2018-12-24 13:51:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-24 13:51:32,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:32,440 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1] [2018-12-24 13:51:32,441 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:32,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:32,441 INFO L82 PathProgramCache]: Analyzing trace with hash -699074251, now seen corresponding path program 73 times [2018-12-24 13:51:32,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:32,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:32,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:32,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:32,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:32,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:34,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-24 13:51:34,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:34,700 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:34,701 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:34,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:34,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:34,701 INFO 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 [2018-12-24 13:51:34,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:34,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:34,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-24 13:51:34,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:41,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 2701 trivial. 0 not checked. [2018-12-24 13:51:41,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:41,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-24 13:51:41,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:41,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 13:51:41,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 13:51:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 13:51:41,169 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand 76 states. [2018-12-24 13:51:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:41,729 INFO L93 Difference]: Finished difference Result 229 states and 232 transitions. [2018-12-24 13:51:41,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 13:51:41,730 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-24 13:51:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:41,730 INFO L225 Difference]: With dead ends: 229 [2018-12-24 13:51:41,730 INFO L226 Difference]: Without dead ends: 153 [2018-12-24 13:51:41,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-24 13:51:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-24 13:51:41,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-24 13:51:41,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-24 13:51:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-24 13:51:41,734 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 150 [2018-12-24 13:51:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:41,734 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-24 13:51:41,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 13:51:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-24 13:51:41,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-24 13:51:41,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:41,735 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1] [2018-12-24 13:51:41,735 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:41,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:41,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1078160534, now seen corresponding path program 74 times [2018-12-24 13:51:41,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:41,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:41,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:41,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:43,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-24 13:51:43,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:43,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:43,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:43,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:43,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:43,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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:51:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:43,767 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:46,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-24 13:51:46,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:46,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-24 13:51:46,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 2775 trivial. 0 not checked. [2018-12-24 13:51:52,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:52,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-24 13:51:52,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:52,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-24 13:51:52,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-24 13:51:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:51:52,554 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 77 states. [2018-12-24 13:51:53,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:53,176 INFO L93 Difference]: Finished difference Result 232 states and 235 transitions. [2018-12-24 13:51:53,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 13:51:53,181 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-12-24 13:51:53,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:53,182 INFO L225 Difference]: With dead ends: 232 [2018-12-24 13:51:53,182 INFO L226 Difference]: Without dead ends: 155 [2018-12-24 13:51:53,183 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 [2018-12-24 13:51:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-24 13:51:53,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-24 13:51:53,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-24 13:51:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-24 13:51:53,187 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-24 13:51:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:53,187 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-24 13:51:53,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-24 13:51:53,187 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-24 13:51:53,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-24 13:51:53,188 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:53,188 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1] [2018-12-24 13:51:53,188 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:53,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:53,188 INFO L82 PathProgramCache]: Analyzing trace with hash -265541227, now seen corresponding path program 75 times [2018-12-24 13:51:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:53,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:53,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:53,189 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:55,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-24 13:51:55,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:55,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:55,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:55,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:55,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:55,290 INFO 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 [2018-12-24 13:51:55,299 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:55,299 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:55,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:55,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:55,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:55,432 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-24 13:51:55,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:01,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-12-24 13:52:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:01,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-24 13:52:01,944 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:01,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 13:52:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 13:52:01,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:52:01,946 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 78 states. [2018-12-24 13:52:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:02,667 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-24 13:52:02,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 13:52:02,668 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-24 13:52:02,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:02,668 INFO L225 Difference]: With dead ends: 235 [2018-12-24 13:52:02,669 INFO L226 Difference]: Without dead ends: 157 [2018-12-24 13:52:02,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:52:02,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-24 13:52:02,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-24 13:52:02,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-24 13:52:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-24 13:52:02,672 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-24 13:52:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:02,672 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-24 13:52:02,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 13:52:02,672 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-24 13:52:02,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-24 13:52:02,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:02,673 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1] [2018-12-24 13:52:02,673 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:02,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:02,673 INFO L82 PathProgramCache]: Analyzing trace with hash 289395338, now seen corresponding path program 76 times [2018-12-24 13:52:02,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:02,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:02,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:04,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-24 13:52:04,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:04,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:04,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:04,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:04,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:04,862 INFO 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 [2018-12-24 13:52:04,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:04,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:04,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:05,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-24 13:52:05,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:11,488 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 2926 trivial. 0 not checked. [2018-12-24 13:52:11,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:11,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-24 13:52:11,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:11,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-24 13:52:11,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-24 13:52:11,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:52:11,508 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 79 states. [2018-12-24 13:52:12,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:12,194 INFO L93 Difference]: Finished difference Result 238 states and 241 transitions. [2018-12-24 13:52:12,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 13:52:12,194 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-24 13:52:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:12,195 INFO L225 Difference]: With dead ends: 238 [2018-12-24 13:52:12,196 INFO L226 Difference]: Without dead ends: 159 [2018-12-24 13:52:12,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:52:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-24 13:52:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-24 13:52:12,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-24 13:52:12,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-12-24 13:52:12,199 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 156 [2018-12-24 13:52:12,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:12,200 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-12-24 13:52:12,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-24 13:52:12,200 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-12-24 13:52:12,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-24 13:52:12,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:12,201 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1] [2018-12-24 13:52:12,201 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:12,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:12,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1275440651, now seen corresponding path program 77 times [2018-12-24 13:52:12,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:12,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:12,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:14,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-24 13:52:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:14,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:14,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:14,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:14,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:14,434 INFO 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 [2018-12-24 13:52:14,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:14,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:19,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-24 13:52:19,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:19,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:19,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-24 13:52:19,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 3003 trivial. 0 not checked. [2018-12-24 13:52:26,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:26,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-24 13:52:26,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:26,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 13:52:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 13:52:26,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:52:26,031 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 80 states. [2018-12-24 13:52:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:26,823 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-12-24 13:52:26,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 13:52:26,823 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-24 13:52:26,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:26,824 INFO L225 Difference]: With dead ends: 241 [2018-12-24 13:52:26,824 INFO L226 Difference]: Without dead ends: 161 [2018-12-24 13:52:26,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:52:26,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-24 13:52:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-24 13:52:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-24 13:52:26,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-24 13:52:26,828 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 158 [2018-12-24 13:52:26,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:26,829 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-24 13:52:26,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 13:52:26,829 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-24 13:52:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-24 13:52:26,830 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:26,830 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1] [2018-12-24 13:52:26,830 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash 399333802, now seen corresponding path program 78 times [2018-12-24 13:52:26,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:26,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:26,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:26,831 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-24 13:52:29,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:29,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:29,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:29,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:29,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:29,265 INFO 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 [2018-12-24 13:52:29,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:29,273 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:29,387 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:29,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:29,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:29,413 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-24 13:52:29,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 3081 trivial. 0 not checked. [2018-12-24 13:52:36,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:36,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-24 13:52:36,219 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:36,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-24 13:52:36,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-24 13:52:36,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:52:36,221 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 81 states. [2018-12-24 13:52:37,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:37,049 INFO L93 Difference]: Finished difference Result 244 states and 247 transitions. [2018-12-24 13:52:37,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 13:52:37,049 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-24 13:52:37,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:37,050 INFO L225 Difference]: With dead ends: 244 [2018-12-24 13:52:37,050 INFO L226 Difference]: Without dead ends: 163 [2018-12-24 13:52:37,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:52:37,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-24 13:52:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-24 13:52:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-24 13:52:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-24 13:52:37,055 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-24 13:52:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:37,055 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-24 13:52:37,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-24 13:52:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-24 13:52:37,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-24 13:52:37,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:37,057 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1] [2018-12-24 13:52:37,057 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:37,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:37,057 INFO L82 PathProgramCache]: Analyzing trace with hash 77165141, now seen corresponding path program 79 times [2018-12-24 13:52:37,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:37,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:37,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:37,058 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-24 13:52:39,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:39,561 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:39,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:39,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:39,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:39,561 INFO 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 [2018-12-24 13:52:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:39,570 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:39,687 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-24 13:52:39,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2018-12-24 13:52:46,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-24 13:52:46,753 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:46,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 13:52:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 13:52:46,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:52:46,755 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 82 states. [2018-12-24 13:52:47,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:47,574 INFO L93 Difference]: Finished difference Result 247 states and 250 transitions. [2018-12-24 13:52:47,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 13:52:47,574 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-24 13:52:47,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:47,575 INFO L225 Difference]: With dead ends: 247 [2018-12-24 13:52:47,575 INFO L226 Difference]: Without dead ends: 165 [2018-12-24 13:52:47,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:52:47,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-24 13:52:47,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-24 13:52:47,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-24 13:52:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-24 13:52:47,578 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-24 13:52:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:47,579 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-24 13:52:47,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 13:52:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-24 13:52:47,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-24 13:52:47,579 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:47,580 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1] [2018-12-24 13:52:47,580 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:47,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:47,580 INFO L82 PathProgramCache]: Analyzing trace with hash -257218358, now seen corresponding path program 80 times [2018-12-24 13:52:47,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:47,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:47,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:47,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-24 13:52:50,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:50,034 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:50,034 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:50,034 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:50,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:50,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:52:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:50,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:53,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-24 13:52:53,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:53,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-24 13:52:53,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked. [2018-12-24 13:53:00,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:00,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-24 13:53:00,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:00,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-24 13:53:00,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-24 13:53:00,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:53:00,673 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 83 states. [2018-12-24 13:53:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:01,524 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-24 13:53:01,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 13:53:01,524 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-12-24 13:53:01,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:01,525 INFO L225 Difference]: With dead ends: 250 [2018-12-24 13:53:01,525 INFO L226 Difference]: Without dead ends: 167 [2018-12-24 13:53:01,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:53:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-24 13:53:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-24 13:53:01,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-24 13:53:01,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 168 transitions. [2018-12-24 13:53:01,529 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 168 transitions. Word has length 164 [2018-12-24 13:53:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:01,529 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 168 transitions. [2018-12-24 13:53:01,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-24 13:53:01,529 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 168 transitions. [2018-12-24 13:53:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-24 13:53:01,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:01,530 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1] [2018-12-24 13:53:01,530 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:01,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:01,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1516473013, now seen corresponding path program 81 times [2018-12-24 13:53:01,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:01,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:01,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:01,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:01,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:04,345 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-24 13:53:04,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:04,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:04,345 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:04,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:04,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:04,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:04,353 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:04,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:04,473 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:04,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:04,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-24 13:53:04,500 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-12-24 13:53:11,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:11,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-24 13:53:11,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:11,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 13:53:11,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 13:53:11,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:53:11,805 INFO L87 Difference]: Start difference. First operand 167 states and 168 transitions. Second operand 84 states. [2018-12-24 13:53:12,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:12,496 INFO L93 Difference]: Finished difference Result 253 states and 256 transitions. [2018-12-24 13:53:12,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 13:53:12,496 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-24 13:53:12,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:12,497 INFO L225 Difference]: With dead ends: 253 [2018-12-24 13:53:12,497 INFO L226 Difference]: Without dead ends: 169 [2018-12-24 13:53:12,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:53:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-24 13:53:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-24 13:53:12,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-24 13:53:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-24 13:53:12,501 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 166 [2018-12-24 13:53:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:12,501 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-24 13:53:12,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 13:53:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-24 13:53:12,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-24 13:53:12,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:12,502 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1] [2018-12-24 13:53:12,502 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:12,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:12,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1671380970, now seen corresponding path program 82 times [2018-12-24 13:53:12,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:12,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:12,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:12,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-24 13:53:15,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:15,359 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:15,359 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:15,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:15,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:15,359 INFO 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 [2018-12-24 13:53:15,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:15,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:15,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-24 13:53:15,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 3403 trivial. 0 not checked. [2018-12-24 13:53:23,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:23,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-24 13:53:23,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:23,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-24 13:53:23,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-24 13:53:23,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:53:23,170 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 85 states. [2018-12-24 13:53:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:24,095 INFO L93 Difference]: Finished difference Result 256 states and 259 transitions. [2018-12-24 13:53:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 13:53:24,095 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-24 13:53:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:24,096 INFO L225 Difference]: With dead ends: 256 [2018-12-24 13:53:24,096 INFO L226 Difference]: Without dead ends: 171 [2018-12-24 13:53:24,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:53:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-24 13:53:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-24 13:53:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-24 13:53:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-24 13:53:24,099 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-24 13:53:24,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:24,100 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-24 13:53:24,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-24 13:53:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-24 13:53:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-24 13:53:24,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:24,100 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1] [2018-12-24 13:53:24,101 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:24,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1664260885, now seen corresponding path program 83 times [2018-12-24 13:53:24,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:24,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:24,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:24,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:26,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-24 13:53:26,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:26,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:26,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:26,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:26,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:26,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:53:26,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:26,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:36,536 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-24 13:53:36,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:36,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-24 13:53:36,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2018-12-24 13:53:44,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:44,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-24 13:53:44,602 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:44,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 13:53:44,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 13:53:44,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:53:44,603 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 86 states. [2018-12-24 13:53:45,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:45,597 INFO L93 Difference]: Finished difference Result 259 states and 262 transitions. [2018-12-24 13:53:45,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 13:53:45,597 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-24 13:53:45,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:45,598 INFO L225 Difference]: With dead ends: 259 [2018-12-24 13:53:45,598 INFO L226 Difference]: Without dead ends: 173 [2018-12-24 13:53:45,599 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:53:45,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-24 13:53:45,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-24 13:53:45,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-24 13:53:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-24 13:53:45,602 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-24 13:53:45,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:45,602 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-24 13:53:45,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 13:53:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-24 13:53:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-24 13:53:45,603 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:45,603 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1] [2018-12-24 13:53:45,603 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1123000074, now seen corresponding path program 84 times [2018-12-24 13:53:45,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:45,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:45,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:45,604 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-24 13:53:48,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:48,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:48,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:48,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:48,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:48,236 INFO 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 [2018-12-24 13:53:48,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:48,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:48,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:48,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:48,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:48,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-24 13:53:48,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:56,466 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 3570 trivial. 0 not checked. [2018-12-24 13:53:56,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:56,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-24 13:53:56,486 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:56,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-24 13:53:56,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-24 13:53:56,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:53:56,487 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 87 states. [2018-12-24 13:53:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:57,486 INFO L93 Difference]: Finished difference Result 262 states and 265 transitions. [2018-12-24 13:53:57,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 13:53:57,486 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-24 13:53:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:57,487 INFO L225 Difference]: With dead ends: 262 [2018-12-24 13:53:57,487 INFO L226 Difference]: Without dead ends: 175 [2018-12-24 13:53:57,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:53:57,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-24 13:53:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-24 13:53:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-24 13:53:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-12-24 13:53:57,492 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 172 [2018-12-24 13:53:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:57,492 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-12-24 13:53:57,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-24 13:53:57,492 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-12-24 13:53:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-24 13:53:57,493 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:57,493 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1] [2018-12-24 13:53:57,494 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725003, now seen corresponding path program 85 times [2018-12-24 13:53:57,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:57,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:57,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:57,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:57,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:00,437 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-24 13:54:00,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:00,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:00,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:00,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:00,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:00,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:54:00,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:00,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:00,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:00,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-24 13:54:00,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:08,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2018-12-24 13:54:08,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:08,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-24 13:54:08,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:08,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 13:54:08,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 13:54:08,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:54:08,455 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 88 states. [2018-12-24 13:54:09,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:09,438 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-24 13:54:09,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 13:54:09,439 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-24 13:54:09,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:09,439 INFO L225 Difference]: With dead ends: 265 [2018-12-24 13:54:09,439 INFO L226 Difference]: Without dead ends: 177 [2018-12-24 13:54:09,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:54:09,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-24 13:54:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-24 13:54:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-24 13:54:09,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-24 13:54:09,443 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 174 [2018-12-24 13:54:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:09,444 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-24 13:54:09,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 13:54:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-24 13:54:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-24 13:54:09,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:09,445 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1] [2018-12-24 13:54:09,445 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:09,446 INFO L82 PathProgramCache]: Analyzing trace with hash -882751958, now seen corresponding path program 86 times [2018-12-24 13:54:09,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:09,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:09,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:09,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:09,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-24 13:54:12,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:12,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:12,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:12,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:12,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:12,237 INFO 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 [2018-12-24 13:54:12,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:12,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:22,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-24 13:54:22,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:22,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:22,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-24 13:54:22,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:30,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 3741 trivial. 0 not checked. [2018-12-24 13:54:30,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:30,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-24 13:54:30,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:30,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-24 13:54:30,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-24 13:54:30,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:54:30,953 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 89 states. [2018-12-24 13:54:31,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:31,825 INFO L93 Difference]: Finished difference Result 268 states and 271 transitions. [2018-12-24 13:54:31,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 13:54:31,826 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-12-24 13:54:31,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:31,827 INFO L225 Difference]: With dead ends: 268 [2018-12-24 13:54:31,827 INFO L226 Difference]: Without dead ends: 179 [2018-12-24 13:54:31,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:54:31,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-24 13:54:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-24 13:54:31,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-24 13:54:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-24 13:54:31,831 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-24 13:54:31,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:31,831 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-24 13:54:31,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-24 13:54:31,832 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-24 13:54:31,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-24 13:54:31,832 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:31,832 INFO L402 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1] [2018-12-24 13:54:31,833 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:31,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:31,833 INFO L82 PathProgramCache]: Analyzing trace with hash 281519061, now seen corresponding path program 87 times [2018-12-24 13:54:31,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:31,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:31,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:31,834 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:34,679 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-24 13:54:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:34,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:34,680 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:34,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:34,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:34,680 INFO 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 [2018-12-24 13:54:34,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:34,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:34,819 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:34,819 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:34,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-24 13:54:34,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked. [2018-12-24 13:54:43,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:43,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-24 13:54:43,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:43,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 13:54:43,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 13:54:43,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:54:43,347 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 90 states. [2018-12-24 13:54:44,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:44,464 INFO L93 Difference]: Finished difference Result 271 states and 274 transitions. [2018-12-24 13:54:44,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 13:54:44,465 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-24 13:54:44,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:44,465 INFO L225 Difference]: With dead ends: 271 [2018-12-24 13:54:44,465 INFO L226 Difference]: Without dead ends: 181 [2018-12-24 13:54:44,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:54:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-24 13:54:44,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-24 13:54:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 13:54:44,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-24 13:54:44,469 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-24 13:54:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:44,469 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-24 13:54:44,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 13:54:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-24 13:54:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 13:54:44,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:44,470 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1] [2018-12-24 13:54:44,470 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:44,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:44,471 INFO L82 PathProgramCache]: Analyzing trace with hash 71120202, now seen corresponding path program 88 times [2018-12-24 13:54:44,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:44,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:44,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:44,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:44,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-24 13:54:47,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:47,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:47,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:47,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:47,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:47,706 INFO 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 [2018-12-24 13:54:47,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:47,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:47,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:47,870 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-24 13:54:47,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:56,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 3916 trivial. 0 not checked. [2018-12-24 13:54:56,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:56,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-24 13:54:56,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:56,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-24 13:54:56,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-24 13:54:56,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:54:56,753 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 91 states. [2018-12-24 13:54:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:57,645 INFO L93 Difference]: Finished difference Result 274 states and 277 transitions. [2018-12-24 13:54:57,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 13:54:57,645 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-24 13:54:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:57,646 INFO L225 Difference]: With dead ends: 274 [2018-12-24 13:54:57,646 INFO L226 Difference]: Without dead ends: 183 [2018-12-24 13:54:57,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:54:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-24 13:54:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-24 13:54:57,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-24 13:54:57,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-12-24 13:54:57,650 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 180 [2018-12-24 13:54:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:57,650 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-12-24 13:54:57,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-24 13:54:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-12-24 13:54:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-24 13:54:57,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:57,651 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1] [2018-12-24 13:54:57,651 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:57,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:57,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1128162251, now seen corresponding path program 89 times [2018-12-24 13:54:57,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:57,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:57,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:57,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-24 13:55:00,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:00,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:00,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:00,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:00,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:00,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:55:00,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:00,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:06,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-24 13:55:06,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:06,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-24 13:55:06,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 4005 trivial. 0 not checked. [2018-12-24 13:55:14,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:14,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-24 13:55:14,854 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:14,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 13:55:14,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 13:55:14,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:55:14,856 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 92 states. [2018-12-24 13:55:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:15,742 INFO L93 Difference]: Finished difference Result 277 states and 280 transitions. [2018-12-24 13:55:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 13:55:15,742 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-12-24 13:55:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:15,743 INFO L225 Difference]: With dead ends: 277 [2018-12-24 13:55:15,743 INFO L226 Difference]: Without dead ends: 185 [2018-12-24 13:55:15,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:55:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-24 13:55:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-12-24 13:55:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-24 13:55:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-24 13:55:15,747 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 182 [2018-12-24 13:55:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:15,748 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-24 13:55:15,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 13:55:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-24 13:55:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-24 13:55:15,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:15,749 INFO L402 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1] [2018-12-24 13:55:15,749 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:15,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:15,749 INFO L82 PathProgramCache]: Analyzing trace with hash 524708970, now seen corresponding path program 90 times [2018-12-24 13:55:15,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:15,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:15,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:15,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-24 13:55:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:18,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:18,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:18,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:18,977 INFO 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 [2018-12-24 13:55:18,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:18,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:19,114 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:19,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:19,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:19,147 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-24 13:55:19,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 4095 trivial. 0 not checked. [2018-12-24 13:55:28,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:28,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-24 13:55:28,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-24 13:55:28,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-24 13:55:28,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:55:28,193 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 93 states. [2018-12-24 13:55:29,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:29,154 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-24 13:55:29,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 13:55:29,154 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-12-24 13:55:29,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:29,155 INFO L225 Difference]: With dead ends: 280 [2018-12-24 13:55:29,155 INFO L226 Difference]: Without dead ends: 187 [2018-12-24 13:55:29,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:55:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-24 13:55:29,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-24 13:55:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-24 13:55:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-24 13:55:29,161 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-24 13:55:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:29,161 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-24 13:55:29,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-24 13:55:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-24 13:55:29,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-24 13:55:29,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:29,163 INFO L402 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1] [2018-12-24 13:55:29,163 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:29,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:29,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1781042325, now seen corresponding path program 91 times [2018-12-24 13:55:29,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:29,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:29,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:29,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:32,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-24 13:55:32,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:32,507 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:32,508 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:32,508 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:32,508 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:32,508 INFO 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 [2018-12-24 13:55:32,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:32,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:32,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:32,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-24 13:55:32,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 4186 trivial. 0 not checked. [2018-12-24 13:55:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:42,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-24 13:55:42,238 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:42,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 13:55:42,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 13:55:42,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:55:42,240 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 94 states. [2018-12-24 13:55:43,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:43,511 INFO L93 Difference]: Finished difference Result 283 states and 286 transitions. [2018-12-24 13:55:43,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 13:55:43,512 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-12-24 13:55:43,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:43,512 INFO L225 Difference]: With dead ends: 283 [2018-12-24 13:55:43,512 INFO L226 Difference]: Without dead ends: 189 [2018-12-24 13:55:43,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:55:43,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-24 13:55:43,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-24 13:55:43,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-24 13:55:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-24 13:55:43,517 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-24 13:55:43,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:43,518 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-24 13:55:43,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 13:55:43,518 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-24 13:55:43,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-24 13:55:43,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:43,519 INFO L402 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1] [2018-12-24 13:55:43,519 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash -658248822, now seen corresponding path program 92 times [2018-12-24 13:55:43,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:43,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:43,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:43,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-24 13:55:46,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:46,959 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:46,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:46,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:46,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:46,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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:55:46,968 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:46,968 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:52,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-24 13:55:52,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:52,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-24 13:55:52,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:02,346 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 4278 trivial. 0 not checked. [2018-12-24 13:56:02,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:02,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-24 13:56:02,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:02,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-24 13:56:02,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-24 13:56:02,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:56:02,375 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 95 states. [2018-12-24 13:56:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:03,454 INFO L93 Difference]: Finished difference Result 286 states and 289 transitions. [2018-12-24 13:56:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 13:56:03,454 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-12-24 13:56:03,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:03,455 INFO L225 Difference]: With dead ends: 286 [2018-12-24 13:56:03,455 INFO L226 Difference]: Without dead ends: 191 [2018-12-24 13:56:03,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:56:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-24 13:56:03,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-24 13:56:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-24 13:56:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 192 transitions. [2018-12-24 13:56:03,459 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 192 transitions. Word has length 188 [2018-12-24 13:56:03,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:03,460 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 192 transitions. [2018-12-24 13:56:03,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-24 13:56:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 192 transitions. [2018-12-24 13:56:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-12-24 13:56:03,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:03,461 INFO L402 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1] [2018-12-24 13:56:03,461 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:03,461 INFO L82 PathProgramCache]: Analyzing trace with hash 844526837, now seen corresponding path program 93 times [2018-12-24 13:56:03,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:03,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:03,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:03,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:06,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-24 13:56:06,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:06,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:06,713 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:06,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:06,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:06,713 INFO 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 [2018-12-24 13:56:06,721 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:06,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:06,857 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:06,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:06,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-24 13:56:06,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 4371 trivial. 0 not checked. [2018-12-24 13:56:16,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:16,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-24 13:56:16,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:16,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 13:56:16,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 13:56:16,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:56:16,787 INFO L87 Difference]: Start difference. First operand 191 states and 192 transitions. Second operand 96 states. [2018-12-24 13:56:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:18,097 INFO L93 Difference]: Finished difference Result 289 states and 292 transitions. [2018-12-24 13:56:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 13:56:18,097 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-12-24 13:56:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:18,098 INFO L225 Difference]: With dead ends: 289 [2018-12-24 13:56:18,098 INFO L226 Difference]: Without dead ends: 193 [2018-12-24 13:56:18,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:56:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-24 13:56:18,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-12-24 13:56:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-24 13:56:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-24 13:56:18,102 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 190 [2018-12-24 13:56:18,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:18,102 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-24 13:56:18,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 13:56:18,102 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-24 13:56:18,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-24 13:56:18,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:18,103 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1] [2018-12-24 13:56:18,103 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:18,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:18,103 INFO L82 PathProgramCache]: Analyzing trace with hash -679759190, now seen corresponding path program 94 times [2018-12-24 13:56:18,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:18,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:18,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:18,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-24 13:56:21,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:21,398 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:21,398 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:21,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:21,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:21,399 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:56:21,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:21,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:21,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:21,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:21,578 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-24 13:56:21,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:31,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 4465 trivial. 0 not checked. [2018-12-24 13:56:31,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:31,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-24 13:56:31,613 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:31,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-24 13:56:31,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-24 13:56:31,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:56:31,616 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 97 states. [2018-12-24 13:56:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:32,929 INFO L93 Difference]: Finished difference Result 292 states and 295 transitions. [2018-12-24 13:56:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 13:56:32,930 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-12-24 13:56:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:32,930 INFO L225 Difference]: With dead ends: 292 [2018-12-24 13:56:32,930 INFO L226 Difference]: Without dead ends: 195 [2018-12-24 13:56:32,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:56:32,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-24 13:56:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-24 13:56:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-24 13:56:32,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-24 13:56:32,934 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-24 13:56:32,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:32,934 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-24 13:56:32,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-24 13:56:32,934 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-24 13:56:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-24 13:56:32,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:32,935 INFO L402 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1] [2018-12-24 13:56:32,935 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:32,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:32,935 INFO L82 PathProgramCache]: Analyzing trace with hash 606426453, now seen corresponding path program 95 times [2018-12-24 13:56:32,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:32,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:32,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:32,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:36,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-24 13:56:36,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:36,227 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:36,227 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:36,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:36,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:36,228 INFO 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 [2018-12-24 13:56:36,236 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:36,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:42,974 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-24 13:56:42,974 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:42,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:43,014 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-24 13:56:43,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-12-24 13:56:52,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:52,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-24 13:56:52,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:52,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 13:56:52,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 13:56:52,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:56:52,875 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 98 states. [2018-12-24 13:56:54,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:54,403 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-24 13:56:54,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 13:56:54,404 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-12-24 13:56:54,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:54,405 INFO L225 Difference]: With dead ends: 295 [2018-12-24 13:56:54,405 INFO L226 Difference]: Without dead ends: 197 [2018-12-24 13:56:54,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 483 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:56:54,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-24 13:56:54,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-24 13:56:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-24 13:56:54,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-24 13:56:54,409 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-24 13:56:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:54,409 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-24 13:56:54,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 13:56:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-24 13:56:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-24 13:56:54,410 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:54,410 INFO L402 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1] [2018-12-24 13:56:54,411 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:54,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:54,411 INFO L82 PathProgramCache]: Analyzing trace with hash 213107146, now seen corresponding path program 96 times [2018-12-24 13:56:54,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:54,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:54,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:54,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-24 13:56:57,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:57,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:57,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:57,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:57,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:57,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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:56:57,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:57,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:57,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:57,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:57,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-24 13:56:57,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 4656 trivial. 0 not checked. [2018-12-24 13:57:08,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:08,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-24 13:57:08,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:08,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-24 13:57:08,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-24 13:57:08,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:57:08,404 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 99 states. [2018-12-24 13:57:09,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:09,986 INFO L93 Difference]: Finished difference Result 298 states and 301 transitions. [2018-12-24 13:57:09,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 13:57:09,986 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-12-24 13:57:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:09,987 INFO L225 Difference]: With dead ends: 298 [2018-12-24 13:57:09,987 INFO L226 Difference]: Without dead ends: 199 [2018-12-24 13:57:09,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:57:09,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-24 13:57:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-12-24 13:57:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-24 13:57:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 200 transitions. [2018-12-24 13:57:09,991 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 200 transitions. Word has length 196 [2018-12-24 13:57:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:09,991 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 200 transitions. [2018-12-24 13:57:09,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-24 13:57:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 200 transitions. [2018-12-24 13:57:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-24 13:57:09,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:09,992 INFO L402 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1] [2018-12-24 13:57:09,992 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash -470864459, now seen corresponding path program 97 times [2018-12-24 13:57:09,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:09,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:09,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:09,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:13,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-24 13:57:13,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:13,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:13,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:13,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:13,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:13,428 INFO 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 [2018-12-24 13:57:13,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:13,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:13,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-24 13:57:13,605 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 4753 trivial. 0 not checked. [2018-12-24 13:57:23,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:23,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-24 13:57:23,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:23,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 13:57:23,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 13:57:23,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:57:23,921 INFO L87 Difference]: Start difference. First operand 199 states and 200 transitions. Second operand 100 states. [2018-12-24 13:57:25,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:25,210 INFO L93 Difference]: Finished difference Result 301 states and 304 transitions. [2018-12-24 13:57:25,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 13:57:25,211 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-12-24 13:57:25,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:25,211 INFO L225 Difference]: With dead ends: 301 [2018-12-24 13:57:25,211 INFO L226 Difference]: Without dead ends: 201 [2018-12-24 13:57:25,212 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 [2018-12-24 13:57:25,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-24 13:57:25,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-24 13:57:25,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-24 13:57:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-24 13:57:25,215 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 198 [2018-12-24 13:57:25,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:25,216 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-24 13:57:25,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 13:57:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-24 13:57:25,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-24 13:57:25,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:25,216 INFO L402 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1] [2018-12-24 13:57:25,217 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:25,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:25,217 INFO L82 PathProgramCache]: Analyzing trace with hash 338827498, now seen corresponding path program 98 times [2018-12-24 13:57:25,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:25,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:25,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:25,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:25,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:28,782 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-24 13:57:28,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:28,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:28,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:28,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:28,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:28,783 INFO 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 [2018-12-24 13:57:28,792 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:28,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:45,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-24 13:57:45,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:45,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-24 13:57:45,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:56,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 4851 trivial. 0 not checked. [2018-12-24 13:57:56,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:56,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-24 13:57:56,258 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:56,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-24 13:57:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-24 13:57:56,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:57:56,261 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 101 states. [2018-12-24 13:57:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:57,916 INFO L93 Difference]: Finished difference Result 304 states and 307 transitions. [2018-12-24 13:57:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 13:57:57,917 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-12-24 13:57:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:57,918 INFO L225 Difference]: With dead ends: 304 [2018-12-24 13:57:57,918 INFO L226 Difference]: Without dead ends: 203 [2018-12-24 13:57:57,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:57:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-24 13:57:57,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-24 13:57:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-24 13:57:57,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-24 13:57:57,922 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-24 13:57:57,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:57,922 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-24 13:57:57,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-24 13:57:57,922 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-24 13:57:57,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-24 13:57:57,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:57,923 INFO L402 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1] [2018-12-24 13:57:57,923 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:57,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:57,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1267596821, now seen corresponding path program 99 times [2018-12-24 13:57:57,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:57,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:57,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:57,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:57,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:57,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:01,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-24 13:58:01,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:01,841 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:01,841 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:01,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:01,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:01,842 INFO 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 [2018-12-24 13:58:01,851 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:01,851 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:01,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:01,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:01,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-24 13:58:02,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 4950 trivial. 0 not checked. [2018-12-24 13:58:13,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:13,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-24 13:58:13,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:13,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 13:58:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 13:58:13,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:58:13,124 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 102 states. [2018-12-24 13:58:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:14,840 INFO L93 Difference]: Finished difference Result 307 states and 310 transitions. [2018-12-24 13:58:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-24 13:58:14,840 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-12-24 13:58:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:14,841 INFO L225 Difference]: With dead ends: 307 [2018-12-24 13:58:14,841 INFO L226 Difference]: Without dead ends: 205 [2018-12-24 13:58:14,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 503 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:58:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-24 13:58:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-24 13:58:14,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-24 13:58:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-24 13:58:14,845 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-24 13:58:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:14,845 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-24 13:58:14,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 13:58:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-24 13:58:14,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-24 13:58:14,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:14,846 INFO L402 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1] [2018-12-24 13:58:14,846 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:14,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:14,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1807960054, now seen corresponding path program 100 times [2018-12-24 13:58:14,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:14,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:14,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:14,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-24 13:58:18,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:18,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:18,729 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:18,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:18,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:18,729 INFO 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 [2018-12-24 13:58:18,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:18,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:18,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-24 13:58:18,937 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:30,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 5050 trivial. 0 not checked. [2018-12-24 13:58:30,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:30,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-24 13:58:30,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:30,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-24 13:58:30,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-24 13:58:30,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 13:58:30,097 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 103 states. [2018-12-24 13:58:31,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:31,699 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-24 13:58:31,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 13:58:31,700 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-12-24 13:58:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:31,701 INFO L225 Difference]: With dead ends: 310 [2018-12-24 13:58:31,701 INFO L226 Difference]: Without dead ends: 207 [2018-12-24 13:58:31,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 508 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-24 13:58:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-12-24 13:58:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-12-24 13:58:31,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-24 13:58:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-12-24 13:58:31,706 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 204 [2018-12-24 13:58:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:31,707 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-12-24 13:58:31,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-24 13:58:31,707 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-12-24 13:58:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-24 13:58:31,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:31,708 INFO L402 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1] [2018-12-24 13:58:31,708 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:31,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:31,709 INFO L82 PathProgramCache]: Analyzing trace with hash 173786741, now seen corresponding path program 101 times [2018-12-24 13:58:31,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:31,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:31,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:31,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:35,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-24 13:58:35,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:35,753 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:35,753 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:35,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:35,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:35,754 INFO 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 [2018-12-24 13:58:35,761 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:58:35,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:58:57,313 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-24 13:58:57,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:57,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-24 13:58:57,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:08,750 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 5151 trivial. 0 not checked. [2018-12-24 13:59:08,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:08,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-24 13:59:08,794 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:08,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 13:59:08,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 13:59:08,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 13:59:08,797 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 104 states. [2018-12-24 13:59:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:10,721 INFO L93 Difference]: Finished difference Result 313 states and 316 transitions. [2018-12-24 13:59:10,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-24 13:59:10,722 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-12-24 13:59:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:10,723 INFO L225 Difference]: With dead ends: 313 [2018-12-24 13:59:10,723 INFO L226 Difference]: Without dead ends: 209 [2018-12-24 13:59:10,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-24 13:59:10,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-24 13:59:10,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-12-24 13:59:10,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-24 13:59:10,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-24 13:59:10,728 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 206 [2018-12-24 13:59:10,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:10,729 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-24 13:59:10,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 13:59:10,729 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-24 13:59:10,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-24 13:59:10,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:10,730 INFO L402 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1] [2018-12-24 13:59:10,730 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1650876630, now seen corresponding path program 102 times [2018-12-24 13:59:10,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:10,731 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:10,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:10,731 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-24 13:59:14,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:14,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:14,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:14,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:14,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:14,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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-24 13:59:14,915 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:59:14,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:59:15,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:59:15,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:59:15,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-24 13:59:15,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 5253 trivial. 0 not checked. [2018-12-24 13:59:27,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:27,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-24 13:59:27,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:27,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-24 13:59:27,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-24 13:59:27,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 13:59:27,092 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 105 states. [2018-12-24 13:59:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:28,589 INFO L93 Difference]: Finished difference Result 316 states and 319 transitions. [2018-12-24 13:59:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-24 13:59:28,589 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-12-24 13:59:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:28,590 INFO L225 Difference]: With dead ends: 316 [2018-12-24 13:59:28,590 INFO L226 Difference]: Without dead ends: 211 [2018-12-24 13:59:28,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-24 13:59:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-24 13:59:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-24 13:59:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-24 13:59:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-24 13:59:28,595 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-24 13:59:28,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:28,595 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-24 13:59:28,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-24 13:59:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-24 13:59:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-24 13:59:28,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:28,597 INFO L402 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1] [2018-12-24 13:59:28,597 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1160939221, now seen corresponding path program 103 times [2018-12-24 13:59:28,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:28,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:28,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:28,598 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:32,765 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-24 13:59:32,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:32,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:32,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:32,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:32,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:32,766 INFO 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 [2018-12-24 13:59:32,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:32,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:32,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-24 13:59:32,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 5356 trivial. 0 not checked. [2018-12-24 13:59:44,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-24 13:59:44,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:44,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 13:59:44,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 13:59:44,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 13:59:44,900 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 106 states. [2018-12-24 13:59:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:46,717 INFO L93 Difference]: Finished difference Result 319 states and 322 transitions. [2018-12-24 13:59:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-24 13:59:46,723 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-12-24 13:59:46,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:46,724 INFO L225 Difference]: With dead ends: 319 [2018-12-24 13:59:46,724 INFO L226 Difference]: Without dead ends: 213 [2018-12-24 13:59:46,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-24 13:59:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-24 13:59:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-24 13:59:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-24 13:59:46,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-12-24 13:59:46,730 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-12-24 13:59:46,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:46,730 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-12-24 13:59:46,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 13:59:46,731 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-12-24 13:59:46,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-24 13:59:46,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:46,732 INFO L402 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1] [2018-12-24 13:59:46,732 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:46,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:46,732 INFO L82 PathProgramCache]: Analyzing trace with hash 193908298, now seen corresponding path program 104 times [2018-12-24 13:59:46,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:46,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:46,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:46,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation)