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/array4.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:10:21,748 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:10:21,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:10:21,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:10:21,762 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:10:21,763 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:10:21,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:10:21,766 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:10:21,768 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:10:21,769 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:10:21,770 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:10:21,770 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:10:21,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:10:21,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:10:21,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:10:21,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:10:21,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:10:21,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:10:21,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:10:21,780 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:10:21,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:10:21,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:10:21,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:10:21,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:10:21,786 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:10:21,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:10:21,787 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:10:21,788 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:10:21,789 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:10:21,790 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:10:21,791 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:10:21,791 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:10:21,792 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:10:21,792 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:10:21,793 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:10:21,794 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:10:21,794 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 [2019-01-11 14:10:21,807 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:10:21,807 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:10:21,808 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:10:21,809 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:10:21,809 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:10:21,809 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:10:21,809 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:10:21,809 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:10:21,810 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:10:21,810 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:10:21,810 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:10:21,810 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:10:21,810 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:10:21,811 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:10:21,811 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:10:21,812 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:10:21,812 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:10:21,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:10:21,812 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:10:21,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:10:21,813 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:10:21,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:10:21,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:10:21,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:10:21,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:10:21,814 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:10:21,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:10:21,814 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:10:21,814 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:10:21,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:10:21,815 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:10:21,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:10:21,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:10:21,815 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:10:21,815 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:10:21,816 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:10:21,816 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:10:21,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:10:21,816 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:10:21,816 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:10:21,847 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:10:21,860 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:10:21,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:10:21,865 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:10:21,865 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:10:21,866 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl [2019-01-11 14:10:21,866 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array4.i_4.bpl' [2019-01-11 14:10:21,906 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:10:21,908 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:10:21,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:21,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:10:21,909 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:10:21,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,945 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:10:21,946 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:10:21,946 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:10:21,946 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:10:21,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,959 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,960 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,966 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/1) ... [2019-01-11 14:10:21,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:10:21,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:10:21,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:10:21,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:10:21,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:10:22,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:10:22,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:10:22,329 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:10:22,329 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-11 14:10:22,331 INFO L202 PluginConnector]: Adding new model array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:22 BoogieIcfgContainer [2019-01-11 14:10:22,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:10:22,332 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:10:22,332 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:10:22,336 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:10:22,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:10:21" (1/2) ... [2019-01-11 14:10:22,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ae0ffcb and model type array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:10:22, skipping insertion in model container [2019-01-11 14:10:22,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array4.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:10:22" (2/2) ... [2019-01-11 14:10:22,339 INFO L112 eAbstractionObserver]: Analyzing ICFG array4.i_4.bpl [2019-01-11 14:10:22,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:10:22,358 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-11 14:10:22,372 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-11 14:10:22,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:10:22,400 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:10:22,401 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:10:22,401 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:10:22,401 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:10:22,401 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:10:22,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:10:22,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:10:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-11 14:10:22,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:10:22,423 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:22,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:10:22,427 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:22,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:22,433 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-11 14:10:22,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:22,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:22,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:22,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:10:22,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:10:22,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:10:22,573 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:10:22,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:10:22,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:10:22,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:22,590 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-11 14:10:22,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:22,683 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2019-01-11 14:10:22,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:10:22,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-11 14:10:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:22,698 INFO L225 Difference]: With dead ends: 12 [2019-01-11 14:10:22,699 INFO L226 Difference]: Without dead ends: 7 [2019-01-11 14:10:22,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:10:22,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-11 14:10:22,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-11 14:10:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-11 14:10:22,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-11 14:10:22,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-11 14:10:22,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:22,739 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-11 14:10:22,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:10:22,739 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-11 14:10:22,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:10:22,739 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:22,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:10:22,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:22,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:22,740 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-11 14:10:22,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:22,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:22,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:10:22,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:22,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:22,853 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:10:22,855 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-11 14:10:22,902 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:10:22,903 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:10:23,090 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:10:23,092 INFO L272 AbstractInterpreter]: Visited 6 different actions 18 times. Merged at 4 different actions 9 times. Never widened. Performed 166 root evaluator evaluations with a maximum evaluation depth of 5. Performed 166 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-11 14:10:23,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:23,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:10:23,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:23,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:23,133 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:23,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:10:23,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:10:23,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:23,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-11 14:10:23,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:23,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:10:23,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:10:23,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:10:23,492 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2019-01-11 14:10:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:23,616 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2019-01-11 14:10:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:10:23,617 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-11 14:10:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:23,617 INFO L225 Difference]: With dead ends: 13 [2019-01-11 14:10:23,617 INFO L226 Difference]: Without dead ends: 9 [2019-01-11 14:10:23,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:10:23,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-11 14:10:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-11 14:10:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-11 14:10:23,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-11 14:10:23,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2019-01-11 14:10:23,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:23,623 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-11 14:10:23,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:10:23,623 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-11 14:10:23,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-11 14:10:23,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:23,624 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-11 14:10:23,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:23,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:23,625 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 2 times [2019-01-11 14:10:23,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:23,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:23,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:23,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:23,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:23,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:23,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:10:23,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:23,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:23,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:23,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:23,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:23,727 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:23,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:23,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-11 14:10:23,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:23,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:10:23,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:23,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-11 14:10:23,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:23,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-11 14:10:23,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:23,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:10:23,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:10:23,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:10:23,882 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2019-01-11 14:10:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:24,054 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2019-01-11 14:10:24,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:10:24,056 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-01-11 14:10:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:24,057 INFO L225 Difference]: With dead ends: 16 [2019-01-11 14:10:24,057 INFO L226 Difference]: Without dead ends: 11 [2019-01-11 14:10:24,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:10:24,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-11 14:10:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-11 14:10:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-11 14:10:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-11 14:10:24,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-11 14:10:24,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:24,064 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-11 14:10:24,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:10:24,065 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-11 14:10:24,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-11 14:10:24,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:24,066 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-11 14:10:24,066 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:24,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:24,066 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 3 times [2019-01-11 14:10:24,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:24,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 14:10:24,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:24,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:24,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:24,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:24,248 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:24,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:24,276 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:24,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:24,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 14:10:24,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:24,486 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-11 14:10:24,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:24,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-11 14:10:24,519 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:24,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:10:24,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:10:24,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:10:24,520 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 6 states. [2019-01-11 14:10:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:24,591 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2019-01-11 14:10:24,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:10:24,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2019-01-11 14:10:24,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:24,592 INFO L225 Difference]: With dead ends: 19 [2019-01-11 14:10:24,592 INFO L226 Difference]: Without dead ends: 13 [2019-01-11 14:10:24,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:10:24,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-11 14:10:24,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-11 14:10:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-11 14:10:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-11 14:10:24,596 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2019-01-11 14:10:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:24,597 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-11 14:10:24,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:10:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-11 14:10:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-11 14:10:24,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:24,598 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-11 14:10:24,598 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:24,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:24,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 4 times [2019-01-11 14:10:24,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:24,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:24,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,600 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:24,705 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 14:10:24,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:24,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:24,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:24,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:24,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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:24,721 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:24,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:24,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 14:10:24,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:24,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-11 14:10:24,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-11 14:10:24,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:24,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:10:24,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:10:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:10:24,914 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 7 states. [2019-01-11 14:10:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:24,959 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2019-01-11 14:10:24,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:10:24,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2019-01-11 14:10:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:24,961 INFO L225 Difference]: With dead ends: 22 [2019-01-11 14:10:24,961 INFO L226 Difference]: Without dead ends: 15 [2019-01-11 14:10:24,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:10:24,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-11 14:10:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-11 14:10:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-11 14:10:24,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-11 14:10:24,965 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-11 14:10:24,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:24,965 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-11 14:10:24,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:10:24,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-11 14:10:24,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-11 14:10:24,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:24,966 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-11 14:10:24,966 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:24,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:24,967 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 5 times [2019-01-11 14:10:24,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:24,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:24,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:24,970 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 14:10:25,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:25,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:25,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:25,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:25,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:25,331 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:25,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:25,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:25,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:10:25,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:25,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 14:10:25,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:25,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-11 14:10:25,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:25,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-11 14:10:25,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:25,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:10:25,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:10:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:25,527 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 8 states. [2019-01-11 14:10:25,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:25,585 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2019-01-11 14:10:25,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:10:25,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-11 14:10:25,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:25,587 INFO L225 Difference]: With dead ends: 25 [2019-01-11 14:10:25,588 INFO L226 Difference]: Without dead ends: 17 [2019-01-11 14:10:25,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:10:25,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-11 14:10:25,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-11 14:10:25,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-11 14:10:25,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-11 14:10:25,593 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2019-01-11 14:10:25,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:25,594 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-11 14:10:25,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:10:25,594 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-11 14:10:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-11 14:10:25,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:25,595 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-11 14:10:25,595 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:25,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:25,595 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 6 times [2019-01-11 14:10:25,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:25,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:25,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:25,596 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:25,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:25,711 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 14:10:25,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:25,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:25,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:25,712 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:25,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:25,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:25,723 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:25,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:25,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:25,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:25,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 14:10:25,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-11 14:10:25,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:25,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-11 14:10:25,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:25,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:10:25,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:10:25,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:10:25,932 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 9 states. [2019-01-11 14:10:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:25,991 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-11 14:10:25,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:10:25,991 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-01-11 14:10:25,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:25,992 INFO L225 Difference]: With dead ends: 28 [2019-01-11 14:10:25,992 INFO L226 Difference]: Without dead ends: 19 [2019-01-11 14:10:25,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:10:25,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-11 14:10:25,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-11 14:10:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-11 14:10:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-11 14:10:25,997 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-11 14:10:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:25,997 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-11 14:10:25,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:10:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-11 14:10:25,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-11 14:10:25,998 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:25,998 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-11 14:10:25,999 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:25,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:25,999 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 7 times [2019-01-11 14:10:25,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:26,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:26,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 14:10:26,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,290 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:26,290 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:26,290 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:26,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:26,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:26,302 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 14:10:26,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-11 14:10:26,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:26,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-11 14:10:26,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:26,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:10:26,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:10:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:10:26,563 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2019-01-11 14:10:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:26,604 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2019-01-11 14:10:26,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:10:26,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-01-11 14:10:26,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:26,607 INFO L225 Difference]: With dead ends: 31 [2019-01-11 14:10:26,607 INFO L226 Difference]: Without dead ends: 21 [2019-01-11 14:10:26,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:10:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-11 14:10:26,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-11 14:10:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 14:10:26,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-11 14:10:26,612 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-01-11 14:10:26,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:26,612 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-11 14:10:26,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:10:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-11 14:10:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-11 14:10:26,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:26,613 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-11 14:10:26,614 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:26,614 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 8 times [2019-01-11 14:10:26,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:26,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:26,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:26,756 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 14:10:26,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:26,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:26,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:26,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:26,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:26,773 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:26,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:26,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-11 14:10:26,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:26,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 14:10:26,808 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-11 14:10:27,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:27,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-11 14:10:27,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:27,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:10:27,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:10:27,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:10:27,049 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 11 states. [2019-01-11 14:10:27,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:27,225 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-01-11 14:10:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:10:27,226 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-01-11 14:10:27,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:27,226 INFO L225 Difference]: With dead ends: 34 [2019-01-11 14:10:27,226 INFO L226 Difference]: Without dead ends: 23 [2019-01-11 14:10:27,227 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 [2019-01-11 14:10:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-11 14:10:27,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-11 14:10:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:10:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-11 14:10:27,231 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-11 14:10:27,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:27,231 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-11 14:10:27,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:10:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-11 14:10:27,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-11 14:10:27,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:27,232 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-11 14:10:27,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:27,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:27,233 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 9 times [2019-01-11 14:10:27,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,234 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:27,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:27,539 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-11 14:10:27,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:27,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:27,539 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:27,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:27,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:27,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:27,549 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:27,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:27,567 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:27,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:27,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-11 14:10:27,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:27,847 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-11 14:10:27,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:27,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-11 14:10:27,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:27,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:10:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:10:27,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:10:27,869 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-01-11 14:10:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:27,940 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-01-11 14:10:27,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:10:27,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-11 14:10:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:27,948 INFO L225 Difference]: With dead ends: 37 [2019-01-11 14:10:27,948 INFO L226 Difference]: Without dead ends: 25 [2019-01-11 14:10:27,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:10:27,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-11 14:10:27,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-11 14:10:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 14:10:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-11 14:10:27,956 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-01-11 14:10:27,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:27,960 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-11 14:10:27,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:10:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-11 14:10:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-11 14:10:27,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:27,961 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-11 14:10:27,962 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:27,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:27,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 10 times [2019-01-11 14:10:27,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:27,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:27,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:27,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:28,304 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 14:10:28,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:28,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:28,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:28,306 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:28,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:28,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:28,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:28,322 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:28,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 14:10:28,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:29,296 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-11 14:10:29,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:29,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-11 14:10:29,315 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:29,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:10:29,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:10:29,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:10:29,316 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 13 states. [2019-01-11 14:10:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:29,369 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-11 14:10:29,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 14:10:29,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-01-11 14:10:29,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:29,371 INFO L225 Difference]: With dead ends: 40 [2019-01-11 14:10:29,372 INFO L226 Difference]: Without dead ends: 27 [2019-01-11 14:10:29,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:10:29,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-11 14:10:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-11 14:10:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-11 14:10:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-11 14:10:29,376 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-11 14:10:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:29,376 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-11 14:10:29,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:10:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-11 14:10:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-11 14:10:29,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:29,377 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-11 14:10:29,378 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:29,378 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 11 times [2019-01-11 14:10:29,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:29,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:29,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-11 14:10:29,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:29,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:29,572 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:29,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:29,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:29,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:29,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:29,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:29,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-11 14:10:29,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:29,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:29,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:10:29,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:10:29,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:10:29,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-11 14:10:30,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 49 [2019-01-11 14:10:30,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:10:30,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:10:30,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-01-11 14:10:30,139 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-11 14:10:30,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:30,848 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-01-11 14:10:30,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:30,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 36 [2019-01-11 14:10:30,875 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:30,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 14:10:30,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 14:10:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=549, Invalid=711, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 14:10:30,877 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 24 states. [2019-01-11 14:10:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:33,440 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2019-01-11 14:10:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 14:10:33,441 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 26 [2019-01-11 14:10:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:33,441 INFO L225 Difference]: With dead ends: 43 [2019-01-11 14:10:33,442 INFO L226 Difference]: Without dead ends: 29 [2019-01-11 14:10:33,443 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=766, Invalid=1040, Unknown=0, NotChecked=0, Total=1806 [2019-01-11 14:10:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-11 14:10:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-11 14:10:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 14:10:33,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-11 14:10:33,452 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-01-11 14:10:33,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:33,454 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-11 14:10:33,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 14:10:33,454 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-11 14:10:33,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-11 14:10:33,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:33,457 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-11 14:10:33,457 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:33,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 12 times [2019-01-11 14:10:33,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:33,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:33,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:33,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 14:10:33,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:33,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:33,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:33,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:33,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:33,668 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:33,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:33,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:33,735 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:33,735 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:33,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 14:10:33,749 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-11 14:10:34,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:34,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-11 14:10:34,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:34,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-11 14:10:34,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-11 14:10:34,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 14:10:34,037 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2019-01-11 14:10:34,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,117 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2019-01-11 14:10:34,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-11 14:10:34,118 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-01-11 14:10:34,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,119 INFO L225 Difference]: With dead ends: 46 [2019-01-11 14:10:34,119 INFO L226 Difference]: Without dead ends: 31 [2019-01-11 14:10:34,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-11 14:10:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-11 14:10:34,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-11 14:10:34,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:10:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-11 14:10:34,126 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-11 14:10:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,127 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-11 14:10:34,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-11 14:10:34,127 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-11 14:10:34,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-11 14:10:34,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,128 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-11 14:10:34,128 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,128 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 13 times [2019-01-11 14:10:34,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-11 14:10:34,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:34,349 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:34,349 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:34,350 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:34,350 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:34,350 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:34,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:34,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-11 14:10:34,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-11 14:10:34,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:34,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-11 14:10:34,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:34,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-11 14:10:34,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-11 14:10:34,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 14:10:34,865 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 16 states. [2019-01-11 14:10:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:34,952 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2019-01-11 14:10:34,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 14:10:34,953 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-11 14:10:34,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:34,953 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:10:34,954 INFO L226 Difference]: Without dead ends: 33 [2019-01-11 14:10:34,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-11 14:10:34,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-11 14:10:34,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-11 14:10:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-11 14:10:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-11 14:10:34,960 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2019-01-11 14:10:34,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:34,961 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-11 14:10:34,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-11 14:10:34,961 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-11 14:10:34,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-11 14:10:34,962 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:34,962 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-11 14:10:34,962 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:34,962 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 14 times [2019-01-11 14:10:34,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:34,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:34,963 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 14:10:35,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:35,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:35,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:35,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:35,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:35,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:35,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:35,441 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-11 14:10:35,442 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:35,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 14:10:35,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-11 14:10:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 32 [2019-01-11 14:10:35,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:35,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-11 14:10:35,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-11 14:10:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-11 14:10:35,762 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 17 states. [2019-01-11 14:10:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:35,864 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2019-01-11 14:10:35,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-11 14:10:35,865 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2019-01-11 14:10:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:35,865 INFO L225 Difference]: With dead ends: 52 [2019-01-11 14:10:35,865 INFO L226 Difference]: Without dead ends: 35 [2019-01-11 14:10:35,866 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 [2019-01-11 14:10:35,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-11 14:10:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-11 14:10:35,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-11 14:10:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-11 14:10:35,871 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-11 14:10:35,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:35,871 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-11 14:10:35,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-11 14:10:35,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-11 14:10:35,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-11 14:10:35,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:35,872 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-11 14:10:35,872 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:35,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:35,872 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 15 times [2019-01-11 14:10:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:35,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:35,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:36,482 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-11 14:10:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,482 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:36,482 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:36,482 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:36,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:36,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:36,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:36,519 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:36,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:36,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-11 14:10:36,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:37,437 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-01-11 14:10:37,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:37,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-11 14:10:37,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:37,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-11 14:10:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-11 14:10:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 14:10:37,457 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 18 states. [2019-01-11 14:10:37,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:37,582 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2019-01-11 14:10:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-11 14:10:37,582 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-01-11 14:10:37,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:37,583 INFO L225 Difference]: With dead ends: 55 [2019-01-11 14:10:37,583 INFO L226 Difference]: Without dead ends: 37 [2019-01-11 14:10:37,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-11 14:10:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-11 14:10:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-11 14:10:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-11 14:10:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-11 14:10:37,589 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2019-01-11 14:10:37,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:37,590 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-11 14:10:37,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-11 14:10:37,590 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-11 14:10:37,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-11 14:10:37,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:37,591 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-11 14:10:37,591 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:37,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:37,591 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 16 times [2019-01-11 14:10:37,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:37,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:37,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:37,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 14:10:37,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:37,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:37,795 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:37,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:37,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:37,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:37,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:37,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 14:10:37,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:38,615 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-11 14:10:38,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:38,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-11 14:10:38,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:38,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-11 14:10:38,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-11 14:10:38,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 14:10:38,635 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 19 states. [2019-01-11 14:10:38,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:38,705 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-01-11 14:10:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-11 14:10:38,705 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2019-01-11 14:10:38,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:38,706 INFO L225 Difference]: With dead ends: 58 [2019-01-11 14:10:38,707 INFO L226 Difference]: Without dead ends: 39 [2019-01-11 14:10:38,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-11 14:10:38,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-11 14:10:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-11 14:10:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-11 14:10:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-11 14:10:38,714 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-11 14:10:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:38,714 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-11 14:10:38,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-11 14:10:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-11 14:10:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-11 14:10:38,715 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:38,715 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-11 14:10:38,715 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:38,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 17 times [2019-01-11 14:10:38,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:38,717 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 14:10:39,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:39,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:39,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:39,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:39,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:39,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:39,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:39,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-11 14:10:39,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:40,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:40,013 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 14:10:40,013 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:40,916 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-11 14:10:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-11 14:10:40,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:40,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-11 14:10:40,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-11 14:10:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:40,939 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-01-11 14:10:41,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:41,055 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2019-01-11 14:10:41,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-11 14:10:41,055 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-01-11 14:10:41,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:41,056 INFO L225 Difference]: With dead ends: 61 [2019-01-11 14:10:41,056 INFO L226 Difference]: Without dead ends: 41 [2019-01-11 14:10:41,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-11 14:10:41,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-11 14:10:41,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-11 14:10:41,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-11 14:10:41,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-11 14:10:41,063 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2019-01-11 14:10:41,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:41,063 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-11 14:10:41,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-11 14:10:41,064 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-11 14:10:41,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-11 14:10:41,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:41,064 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-11 14:10:41,065 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:41,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:41,065 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 18 times [2019-01-11 14:10:41,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:41,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:41,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:41,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:41,367 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 14:10:41,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:41,367 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:41,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:41,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:41,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:41,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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:41,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:41,401 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:41,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:41,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:41,411 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 14:10:41,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:41,971 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-11 14:10:41,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:41,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-11 14:10:41,990 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:41,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-11 14:10:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-11 14:10:41,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 14:10:41,992 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 21 states. [2019-01-11 14:10:42,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:42,140 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-01-11 14:10:42,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-11 14:10:42,141 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2019-01-11 14:10:42,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:42,141 INFO L225 Difference]: With dead ends: 64 [2019-01-11 14:10:42,142 INFO L226 Difference]: Without dead ends: 43 [2019-01-11 14:10:42,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-11 14:10:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-11 14:10:42,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-11 14:10:42,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-11 14:10:42,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-11 14:10:42,149 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-11 14:10:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:42,149 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-11 14:10:42,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-11 14:10:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-11 14:10:42,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-11 14:10:42,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:42,152 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-11 14:10:42,153 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:42,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:42,153 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 19 times [2019-01-11 14:10:42,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:42,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:42,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:42,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:42,455 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 14:10:42,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:42,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:42,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:42,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:42,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:42,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:42,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:42,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 14:10:42,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:43,090 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-01-11 14:10:43,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:43,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-11 14:10:43,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:43,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-11 14:10:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-11 14:10:43,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 14:10:43,112 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 22 states. [2019-01-11 14:10:43,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:43,184 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2019-01-11 14:10:43,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-11 14:10:43,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2019-01-11 14:10:43,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:43,185 INFO L225 Difference]: With dead ends: 67 [2019-01-11 14:10:43,186 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 14:10:43,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-11 14:10:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 14:10:43,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-11 14:10:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-11 14:10:43,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-11 14:10:43,196 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2019-01-11 14:10:43,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:43,196 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-11 14:10:43,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-11 14:10:43,196 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-11 14:10:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-11 14:10:43,197 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:43,197 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-11 14:10:43,197 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:43,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 20 times [2019-01-11 14:10:43,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:43,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:43,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 14:10:43,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:43,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:43,583 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:43,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:43,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:43,583 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:43,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:43,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:43,687 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-11 14:10:43,688 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:43,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 14:10:43,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-11 14:10:44,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:44,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-11 14:10:44,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:44,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-11 14:10:44,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-11 14:10:44,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-11 14:10:44,319 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 23 states. [2019-01-11 14:10:44,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:44,408 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2019-01-11 14:10:44,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-11 14:10:44,408 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2019-01-11 14:10:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:44,410 INFO L225 Difference]: With dead ends: 70 [2019-01-11 14:10:44,410 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 14:10:44,412 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 [2019-01-11 14:10:44,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 14:10:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-11 14:10:44,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-11 14:10:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-11 14:10:44,417 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-11 14:10:44,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:44,417 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-11 14:10:44,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-11 14:10:44,417 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-11 14:10:44,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-11 14:10:44,418 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:44,418 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-11 14:10:44,418 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:44,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:44,419 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 21 times [2019-01-11 14:10:44,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:44,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:44,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:44,420 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-11 14:10:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:44,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:44,757 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:44,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:44,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:44,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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:44,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:44,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:44,800 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:44,800 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:44,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:44,810 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-11 14:10:44,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2019-01-11 14:10:45,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:45,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-11 14:10:45,427 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:45,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-11 14:10:45,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-11 14:10:45,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 14:10:45,429 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 24 states. [2019-01-11 14:10:45,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:45,574 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2019-01-11 14:10:45,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-11 14:10:45,577 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-01-11 14:10:45,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:45,577 INFO L225 Difference]: With dead ends: 73 [2019-01-11 14:10:45,577 INFO L226 Difference]: Without dead ends: 49 [2019-01-11 14:10:45,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-11 14:10:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-11 14:10:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-11 14:10:45,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-11 14:10:45,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-11 14:10:45,581 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2019-01-11 14:10:45,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:45,582 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-11 14:10:45,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-11 14:10:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-11 14:10:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-11 14:10:45,583 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:45,583 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-11 14:10:45,583 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:45,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:45,583 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 22 times [2019-01-11 14:10:45,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:45,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:45,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:45,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:45,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:45,876 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 14:10:45,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:45,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:45,877 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:45,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:45,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:45,878 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:45,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:45,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:45,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 14:10:45,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-11 14:10:46,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:46,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-11 14:10:46,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:46,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-11 14:10:46,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-11 14:10:46,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 14:10:46,548 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 25 states. [2019-01-11 14:10:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:46,634 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2019-01-11 14:10:46,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-11 14:10:46,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2019-01-11 14:10:46,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:46,635 INFO L225 Difference]: With dead ends: 76 [2019-01-11 14:10:46,636 INFO L226 Difference]: Without dead ends: 51 [2019-01-11 14:10:46,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-11 14:10:46,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-11 14:10:46,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-11 14:10:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-11 14:10:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-11 14:10:46,641 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-11 14:10:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:46,641 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-11 14:10:46,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-11 14:10:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-11 14:10:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-11 14:10:46,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:46,642 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-11 14:10:46,642 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:46,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:46,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 23 times [2019-01-11 14:10:46,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:46,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:46,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:46,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-11 14:10:46,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:46,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:46,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:46,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:46,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:46,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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:46,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:46,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:47,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-11 14:10:47,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:47,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:47,169 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-11 14:10:47,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-01-11 14:10:48,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:48,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 50 [2019-01-11 14:10:48,293 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:48,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-11 14:10:48,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-11 14:10:48,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:48,295 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 26 states. [2019-01-11 14:10:48,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:48,374 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2019-01-11 14:10:48,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-11 14:10:48,374 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2019-01-11 14:10:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:48,375 INFO L225 Difference]: With dead ends: 79 [2019-01-11 14:10:48,375 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 14:10:48,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-11 14:10:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 14:10:48,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-11 14:10:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-11 14:10:48,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-11 14:10:48,382 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2019-01-11 14:10:48,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:48,383 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-11 14:10:48,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-11 14:10:48,383 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-11 14:10:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-11 14:10:48,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:48,384 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-11 14:10:48,384 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:48,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 24 times [2019-01-11 14:10:48,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:48,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:48,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 14:10:48,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:48,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:48,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:48,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:48,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:48,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:48,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:48,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:48,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:48,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:48,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 14:10:48,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-11 14:10:49,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:49,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-11 14:10:49,710 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:49,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-11 14:10:49,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-11 14:10:49,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 14:10:49,711 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 27 states. [2019-01-11 14:10:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:49,846 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-01-11 14:10:49,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-11 14:10:49,846 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2019-01-11 14:10:49,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:49,847 INFO L225 Difference]: With dead ends: 82 [2019-01-11 14:10:49,847 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:10:49,848 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-11 14:10:49,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:10:49,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-11 14:10:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 14:10:49,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-11 14:10:49,852 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-11 14:10:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:49,852 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-11 14:10:49,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-11 14:10:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-11 14:10:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-11 14:10:49,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:49,853 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-11 14:10:49,853 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:49,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 25 times [2019-01-11 14:10:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:49,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:49,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:49,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,304 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-11 14:10:50,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:50,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:50,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:50,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:50,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:50,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:50,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:50,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:50,357 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-11 14:10:50,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:51,439 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-01-11 14:10:51,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:51,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-11 14:10:51,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:51,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-11 14:10:51,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-11 14:10:51,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 14:10:51,459 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 28 states. [2019-01-11 14:10:51,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:51,556 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-01-11 14:10:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-11 14:10:51,557 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2019-01-11 14:10:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:51,558 INFO L225 Difference]: With dead ends: 85 [2019-01-11 14:10:51,558 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 14:10:51,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-11 14:10:51,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 14:10:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-11 14:10:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-11 14:10:51,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-11 14:10:51,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2019-01-11 14:10:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:51,564 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-11 14:10:51,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-11 14:10:51,564 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-11 14:10:51,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-11 14:10:51,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:51,564 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-11 14:10:51,565 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:51,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:51,565 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 26 times [2019-01-11 14:10:51,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:51,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:51,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:51,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 14:10:52,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:52,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:52,118 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:52,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:52,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:52,119 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:52,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:52,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-11 14:10:52,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:52,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:52,291 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 14:10:52,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:53,229 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-11 14:10:53,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:53,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 29] total 56 [2019-01-11 14:10:53,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:53,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-11 14:10:53,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-11 14:10:53,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 14:10:53,250 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 29 states. [2019-01-11 14:10:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:53,330 INFO L93 Difference]: Finished difference Result 88 states and 91 transitions. [2019-01-11 14:10:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-11 14:10:53,331 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2019-01-11 14:10:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:53,332 INFO L225 Difference]: With dead ends: 88 [2019-01-11 14:10:53,332 INFO L226 Difference]: Without dead ends: 59 [2019-01-11 14:10:53,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-11 14:10:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-11 14:10:53,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-11 14:10:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 14:10:53,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-11 14:10:53,335 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-11 14:10:53,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:53,336 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-11 14:10:53,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-11 14:10:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-11 14:10:53,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-11 14:10:53,336 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:53,336 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-11 14:10:53,337 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:53,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:53,337 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 27 times [2019-01-11 14:10:53,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:53,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:53,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:53,949 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-11 14:10:53,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:53,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:53,949 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:53,950 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:53,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:53,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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:53,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:53,958 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:53,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:53,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:53,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:54,004 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-11 14:10:54,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:54,845 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2019-01-11 14:10:54,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:54,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-11 14:10:54,863 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-11 14:10:54,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-11 14:10:54,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-11 14:10:54,865 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 30 states. [2019-01-11 14:10:54,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:54,996 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2019-01-11 14:10:54,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-11 14:10:54,996 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2019-01-11 14:10:54,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:54,997 INFO L225 Difference]: With dead ends: 91 [2019-01-11 14:10:54,997 INFO L226 Difference]: Without dead ends: 61 [2019-01-11 14:10:54,998 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 [2019-01-11 14:10:54,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-11 14:10:55,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-11 14:10:55,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-11 14:10:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-11 14:10:55,001 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2019-01-11 14:10:55,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:55,001 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-11 14:10:55,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-11 14:10:55,001 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-11 14:10:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-11 14:10:55,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:55,002 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-11 14:10:55,002 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:55,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:55,002 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 28 times [2019-01-11 14:10:55,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:55,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:55,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:55,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:55,003 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:55,936 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 14:10:55,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:55,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:55,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:55,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:55,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:55,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:55,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:55,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:10:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:55,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:56,008 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 14:10:56,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:57,091 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-11 14:10:57,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:57,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-11 14:10:57,110 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:57,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-11 14:10:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-11 14:10:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 14:10:57,111 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 31 states. [2019-01-11 14:10:57,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:57,241 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2019-01-11 14:10:57,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-11 14:10:57,241 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2019-01-11 14:10:57,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:57,242 INFO L225 Difference]: With dead ends: 94 [2019-01-11 14:10:57,242 INFO L226 Difference]: Without dead ends: 63 [2019-01-11 14:10:57,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-11 14:10:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-11 14:10:57,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-11 14:10:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-11 14:10:57,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-11 14:10:57,247 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-11 14:10:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:57,247 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-11 14:10:57,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-11 14:10:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-11 14:10:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-11 14:10:57,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:57,248 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-11 14:10:57,248 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:57,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:57,248 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 29 times [2019-01-11 14:10:57,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:10:57,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:57,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-11 14:10:57,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:57,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:57,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:57,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:57,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:57,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:57,734 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:10:57,734 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:10:57,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-11 14:10:57,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:57,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-11 14:10:57,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:10:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-01-11 14:10:59,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:10:59,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 62 [2019-01-11 14:10:59,108 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:10:59,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-11 14:10:59,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-11 14:10:59,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-11 14:10:59,110 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 32 states. [2019-01-11 14:10:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:10:59,182 INFO L93 Difference]: Finished difference Result 97 states and 100 transitions. [2019-01-11 14:10:59,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-11 14:10:59,183 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2019-01-11 14:10:59,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:10:59,184 INFO L225 Difference]: With dead ends: 97 [2019-01-11 14:10:59,184 INFO L226 Difference]: Without dead ends: 65 [2019-01-11 14:10:59,185 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 [2019-01-11 14:10:59,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-11 14:10:59,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-11 14:10:59,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-11 14:10:59,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-11 14:10:59,188 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 62 [2019-01-11 14:10:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:10:59,189 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-11 14:10:59,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-11 14:10:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-11 14:10:59,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-11 14:10:59,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:10:59,189 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-11 14:10:59,189 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:10:59,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:10:59,190 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 30 times [2019-01-11 14:10:59,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:10:59,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:10:59,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:10:59,191 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:10:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:10:59,674 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 14:10:59,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:10:59,674 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:10:59,674 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:10:59,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:10:59,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:10:59,684 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:10:59,684 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:10:59,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:10:59,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:10:59,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:10:59,738 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 14:10:59,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:00,977 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-11 14:11:00,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:00,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-11 14:11:00,997 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:00,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-11 14:11:00,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-11 14:11:00,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 14:11:00,998 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 33 states. [2019-01-11 14:11:01,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:01,112 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2019-01-11 14:11:01,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-11 14:11:01,112 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2019-01-11 14:11:01,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:01,113 INFO L225 Difference]: With dead ends: 100 [2019-01-11 14:11:01,113 INFO L226 Difference]: Without dead ends: 67 [2019-01-11 14:11:01,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-11 14:11:01,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-11 14:11:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-11 14:11:01,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-11 14:11:01,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-11 14:11:01,117 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-11 14:11:01,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:01,118 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-11 14:11:01,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-11 14:11:01,118 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-11 14:11:01,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-11 14:11:01,118 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:01,119 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-11 14:11:01,119 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:01,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:01,119 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 31 times [2019-01-11 14:11:01,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:01,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:01,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:01,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:01,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:02,178 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-11 14:11:02,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:02,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:02,179 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:02,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:02,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:02,179 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:02,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:02,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:02,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-11 14:11:02,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:03,489 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-11 14:11:03,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:03,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-11 14:11:03,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:03,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-11 14:11:03,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-11 14:11:03,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 14:11:03,508 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 34 states. [2019-01-11 14:11:03,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:03,651 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-11 14:11:03,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-11 14:11:03,652 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2019-01-11 14:11:03,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:03,653 INFO L225 Difference]: With dead ends: 103 [2019-01-11 14:11:03,653 INFO L226 Difference]: Without dead ends: 69 [2019-01-11 14:11:03,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-11 14:11:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-11 14:11:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-11 14:11:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-11 14:11:03,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-11 14:11:03,657 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2019-01-11 14:11:03,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:03,657 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-11 14:11:03,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-11 14:11:03,657 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-11 14:11:03,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-11 14:11:03,658 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:03,658 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-11 14:11:03,658 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:03,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:03,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 32 times [2019-01-11 14:11:03,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:03,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:03,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:03,660 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:04,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 14:11:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:04,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:04,201 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:04,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:04,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:04,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:04,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:04,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:04,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-11 14:11:04,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:04,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 14:11:04,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-11 14:11:05,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:05,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-11 14:11:05,638 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:05,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-11 14:11:05,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-11 14:11:05,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 14:11:05,640 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 35 states. [2019-01-11 14:11:05,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:05,825 INFO L93 Difference]: Finished difference Result 106 states and 109 transitions. [2019-01-11 14:11:05,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-11 14:11:05,825 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2019-01-11 14:11:05,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:05,826 INFO L225 Difference]: With dead ends: 106 [2019-01-11 14:11:05,826 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 14:11:05,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-11 14:11:05,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 14:11:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-11 14:11:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-11 14:11:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-11 14:11:05,831 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-11 14:11:05,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:05,831 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-11 14:11:05,831 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-11 14:11:05,831 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-11 14:11:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-11 14:11:05,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:05,832 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-11 14:11:05,832 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:05,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:05,832 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 33 times [2019-01-11 14:11:05,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:05,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:05,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:05,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-11 14:11:06,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:06,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:06,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:06,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:06,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:06,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:06,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:06,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:06,549 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:06,550 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:06,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-11 14:11:06,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-01-11 14:11:07,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:07,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-11 14:11:07,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:07,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-11 14:11:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-11 14:11:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:07,841 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 36 states. [2019-01-11 14:11:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:07,998 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2019-01-11 14:11:07,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-11 14:11:07,999 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2019-01-11 14:11:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:08,000 INFO L225 Difference]: With dead ends: 109 [2019-01-11 14:11:08,000 INFO L226 Difference]: Without dead ends: 73 [2019-01-11 14:11:08,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-11 14:11:08,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-11 14:11:08,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-11 14:11:08,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-11 14:11:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-11 14:11:08,005 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 70 [2019-01-11 14:11:08,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:08,005 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-11 14:11:08,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-11 14:11:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-11 14:11:08,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-11 14:11:08,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:08,006 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-11 14:11:08,006 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:08,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:08,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 34 times [2019-01-11 14:11:08,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:08,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:08,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:08,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:08,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 14:11:08,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:08,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:08,768 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:08,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:08,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:08,769 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:08,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:08,778 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:08,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:08,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 14:11:08,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:10,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-11 14:11:10,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:10,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-11 14:11:10,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:10,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-11 14:11:10,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-11 14:11:10,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-11 14:11:10,191 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states. [2019-01-11 14:11:10,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:10,354 INFO L93 Difference]: Finished difference Result 112 states and 115 transitions. [2019-01-11 14:11:10,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-11 14:11:10,355 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2019-01-11 14:11:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:10,356 INFO L225 Difference]: With dead ends: 112 [2019-01-11 14:11:10,356 INFO L226 Difference]: Without dead ends: 75 [2019-01-11 14:11:10,356 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 [2019-01-11 14:11:10,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-11 14:11:10,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-11 14:11:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-11 14:11:10,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-11 14:11:10,361 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-11 14:11:10,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:10,362 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-11 14:11:10,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-11 14:11:10,362 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-11 14:11:10,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-11 14:11:10,362 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:10,362 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-11 14:11:10,363 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:10,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 35 times [2019-01-11 14:11:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:10,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:10,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:10,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-11 14:11:11,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:11,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:11,447 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:11,447 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:11,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:11,447 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:11,456 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:11,456 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:11,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-11 14:11:11,866 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:11,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:11,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-11 14:11:11,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-01-11 14:11:13,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:13,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-11 14:11:13,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:13,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-11 14:11:13,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-11 14:11:13,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:11:13,324 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 38 states. [2019-01-11 14:11:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:13,459 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2019-01-11 14:11:13,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-11 14:11:13,460 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2019-01-11 14:11:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:13,460 INFO L225 Difference]: With dead ends: 115 [2019-01-11 14:11:13,460 INFO L226 Difference]: Without dead ends: 77 [2019-01-11 14:11:13,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-11 14:11:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-11 14:11:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-11 14:11:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-11 14:11:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-11 14:11:13,465 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2019-01-11 14:11:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:13,465 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-11 14:11:13,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-11 14:11:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-11 14:11:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-11 14:11:13,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:13,465 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-11 14:11:13,466 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 36 times [2019-01-11 14:11:13,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:13,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:13,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:13,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:14,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 14:11:14,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:14,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:14,131 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:14,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:14,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:14,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:14,144 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:14,144 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:14,212 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:14,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:14,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 14:11:14,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-11 14:11:16,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:16,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-11 14:11:16,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:16,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-11 14:11:16,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-11 14:11:16,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 14:11:16,012 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 39 states. [2019-01-11 14:11:16,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:16,215 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2019-01-11 14:11:16,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-11 14:11:16,215 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2019-01-11 14:11:16,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:16,216 INFO L225 Difference]: With dead ends: 118 [2019-01-11 14:11:16,216 INFO L226 Difference]: Without dead ends: 79 [2019-01-11 14:11:16,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-11 14:11:16,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-11 14:11:16,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-11 14:11:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-11 14:11:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-11 14:11:16,219 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-11 14:11:16,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:16,219 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-11 14:11:16,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-11 14:11:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-11 14:11:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-11 14:11:16,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:16,220 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-11 14:11:16,221 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:16,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:16,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 37 times [2019-01-11 14:11:16,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:16,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:16,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:16,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:16,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:17,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-11 14:11:17,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:17,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:17,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:17,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:17,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:17,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:17,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:17,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:17,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-11 14:11:17,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:18,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-01-11 14:11:18,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:18,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-11 14:11:18,867 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:18,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-11 14:11:18,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-11 14:11:18,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 14:11:18,868 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 40 states. [2019-01-11 14:11:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:18,998 INFO L93 Difference]: Finished difference Result 121 states and 124 transitions. [2019-01-11 14:11:18,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-11 14:11:18,998 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2019-01-11 14:11:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:18,999 INFO L225 Difference]: With dead ends: 121 [2019-01-11 14:11:19,000 INFO L226 Difference]: Without dead ends: 81 [2019-01-11 14:11:19,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-11 14:11:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-11 14:11:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-11 14:11:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-11 14:11:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-11 14:11:19,005 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2019-01-11 14:11:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:19,005 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-11 14:11:19,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-11 14:11:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-11 14:11:19,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-11 14:11:19,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:19,006 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-11 14:11:19,006 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:19,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:19,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 38 times [2019-01-11 14:11:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:19,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:19,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:19,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:19,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:19,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 14:11:19,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:19,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:19,702 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:19,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:19,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:19,702 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:19,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:19,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:20,229 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-11 14:11:20,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:20,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:20,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 14:11:20,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-11 14:11:22,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:22,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-11 14:11:22,151 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:22,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-11 14:11:22,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-11 14:11:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:11:22,152 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 41 states. [2019-01-11 14:11:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:22,295 INFO L93 Difference]: Finished difference Result 124 states and 127 transitions. [2019-01-11 14:11:22,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-11 14:11:22,296 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2019-01-11 14:11:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:22,297 INFO L225 Difference]: With dead ends: 124 [2019-01-11 14:11:22,297 INFO L226 Difference]: Without dead ends: 83 [2019-01-11 14:11:22,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-11 14:11:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-11 14:11:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-11 14:11:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 14:11:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-11 14:11:22,302 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-11 14:11:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:22,302 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-11 14:11:22,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-11 14:11:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-11 14:11:22,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-11 14:11:22,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:22,302 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-11 14:11:22,303 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:22,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:22,303 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 39 times [2019-01-11 14:11:22,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:22,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:22,304 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:22,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:22,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:22,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:23,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-11 14:11:23,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:23,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:23,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:23,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:23,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:23,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:23,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:23,265 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:23,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:23,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-11 14:11:23,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2019-01-11 14:11:25,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:25,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-11 14:11:25,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:25,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-11 14:11:25,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-11 14:11:25,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 14:11:25,079 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 42 states. [2019-01-11 14:11:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:25,226 INFO L93 Difference]: Finished difference Result 127 states and 130 transitions. [2019-01-11 14:11:25,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-11 14:11:25,226 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2019-01-11 14:11:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:25,227 INFO L225 Difference]: With dead ends: 127 [2019-01-11 14:11:25,227 INFO L226 Difference]: Without dead ends: 85 [2019-01-11 14:11:25,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-11 14:11:25,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-11 14:11:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-11 14:11:25,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-11 14:11:25,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-11 14:11:25,232 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2019-01-11 14:11:25,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:25,232 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-11 14:11:25,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-11 14:11:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-11 14:11:25,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-11 14:11:25,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:25,233 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-11 14:11:25,233 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:25,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:25,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 40 times [2019-01-11 14:11:25,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:25,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:25,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:25,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:25,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 14:11:26,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:26,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:26,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:26,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:26,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:26,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:26,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:26,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:26,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 14:11:26,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-11 14:11:28,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:28,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-11 14:11:28,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:28,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-11 14:11:28,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-11 14:11:28,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-11 14:11:28,134 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 43 states. [2019-01-11 14:11:28,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:28,279 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2019-01-11 14:11:28,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-11 14:11:28,280 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2019-01-11 14:11:28,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:28,281 INFO L225 Difference]: With dead ends: 130 [2019-01-11 14:11:28,281 INFO L226 Difference]: Without dead ends: 87 [2019-01-11 14:11:28,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-11 14:11:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-11 14:11:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-11 14:11:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-11 14:11:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-11 14:11:28,286 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-11 14:11:28,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:28,286 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-11 14:11:28,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-11 14:11:28,287 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-11 14:11:28,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-11 14:11:28,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:28,287 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-11 14:11:28,287 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:28,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:28,288 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 41 times [2019-01-11 14:11:28,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:28,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:28,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:28,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-11 14:11:29,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:29,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:29,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:29,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:29,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:29,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:29,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:29,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:29,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-11 14:11:29,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:29,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-11 14:11:29,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-01-11 14:11:31,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:31,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-11 14:11:31,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:31,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-11 14:11:31,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-11 14:11:31,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-11 14:11:31,960 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 44 states. [2019-01-11 14:11:32,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:32,101 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2019-01-11 14:11:32,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-11 14:11:32,101 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2019-01-11 14:11:32,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:32,102 INFO L225 Difference]: With dead ends: 133 [2019-01-11 14:11:32,102 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 14:11:32,103 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 [2019-01-11 14:11:32,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 14:11:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-11 14:11:32,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-11 14:11:32,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-11 14:11:32,107 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 86 [2019-01-11 14:11:32,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:32,108 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-11 14:11:32,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-11 14:11:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-11 14:11:32,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-11 14:11:32,108 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:32,108 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-11 14:11:32,109 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:32,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:32,109 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 42 times [2019-01-11 14:11:32,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:32,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:32,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:32,110 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 14:11:33,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:33,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:33,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:33,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:33,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:33,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:33,942 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:33,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:34,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:34,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:34,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 14:11:34,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-11 14:11:36,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:36,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-11 14:11:36,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:36,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-11 14:11:36,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-11 14:11:36,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 14:11:36,050 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 45 states. [2019-01-11 14:11:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:36,203 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2019-01-11 14:11:36,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-11 14:11:36,203 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2019-01-11 14:11:36,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:36,204 INFO L225 Difference]: With dead ends: 136 [2019-01-11 14:11:36,204 INFO L226 Difference]: Without dead ends: 91 [2019-01-11 14:11:36,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-11 14:11:36,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-11 14:11:36,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-11 14:11:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 14:11:36,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-11 14:11:36,209 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-11 14:11:36,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:36,209 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-11 14:11:36,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-11 14:11:36,210 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-11 14:11:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-11 14:11:36,210 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:36,210 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-11 14:11:36,211 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:36,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 43 times [2019-01-11 14:11:36,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:36,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:36,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:36,212 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-11 14:11:37,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:37,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:37,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:37,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:37,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:37,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:37,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:37,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:37,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-11 14:11:37,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2019-01-11 14:11:39,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:39,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-11 14:11:39,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:39,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-11 14:11:39,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-11 14:11:39,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 14:11:39,966 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 46 states. [2019-01-11 14:11:40,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:40,561 INFO L93 Difference]: Finished difference Result 139 states and 142 transitions. [2019-01-11 14:11:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-11 14:11:40,561 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2019-01-11 14:11:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:40,562 INFO L225 Difference]: With dead ends: 139 [2019-01-11 14:11:40,563 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 14:11:40,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-11 14:11:40,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 14:11:40,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-11 14:11:40,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-11 14:11:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-11 14:11:40,567 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2019-01-11 14:11:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:40,568 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-11 14:11:40,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-11 14:11:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-11 14:11:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-11 14:11:40,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:40,568 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-11 14:11:40,568 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:40,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 44 times [2019-01-11 14:11:40,569 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:40,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:40,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:40,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:40,570 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 14:11:42,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:42,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:42,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:42,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:42,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:42,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:42,495 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:42,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:43,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-11 14:11:43,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:43,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:43,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 14:11:43,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-11 14:11:45,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:45,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 47, 47] total 92 [2019-01-11 14:11:45,506 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:45,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-11 14:11:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-11 14:11:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:11:45,507 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 47 states. [2019-01-11 14:11:46,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:46,288 INFO L93 Difference]: Finished difference Result 142 states and 145 transitions. [2019-01-11 14:11:46,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-11 14:11:46,288 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2019-01-11 14:11:46,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:46,289 INFO L225 Difference]: With dead ends: 142 [2019-01-11 14:11:46,289 INFO L226 Difference]: Without dead ends: 95 [2019-01-11 14:11:46,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-11 14:11:46,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-11 14:11:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-11 14:11:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 14:11:46,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-11 14:11:46,293 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-11 14:11:46,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:46,293 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-11 14:11:46,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-11 14:11:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-11 14:11:46,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-11 14:11:46,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:46,294 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-11 14:11:46,294 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 45 times [2019-01-11 14:11:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:46,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:46,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:46,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-11 14:11:47,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:47,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:47,541 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:47,541 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:47,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:47,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:47,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:11:47,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:11:47,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:11:47,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:47,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-11 14:11:47,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:50,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2019-01-11 14:11:50,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:50,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-11 14:11:50,077 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:50,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-11 14:11:50,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-11 14:11:50,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:11:50,078 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 48 states. [2019-01-11 14:11:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:50,252 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2019-01-11 14:11:50,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-11 14:11:50,253 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2019-01-11 14:11:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:50,254 INFO L225 Difference]: With dead ends: 145 [2019-01-11 14:11:50,254 INFO L226 Difference]: Without dead ends: 97 [2019-01-11 14:11:50,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-11 14:11:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-11 14:11:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-11 14:11:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-11 14:11:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-11 14:11:50,258 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2019-01-11 14:11:50,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:50,258 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-11 14:11:50,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-11 14:11:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-11 14:11:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-11 14:11:50,259 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:50,259 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-11 14:11:50,259 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:50,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:50,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 46 times [2019-01-11 14:11:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:50,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:11:50,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:50,260 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:51,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 14:11:51,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:51,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:51,499 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:51,499 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:51,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:51,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:51,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:51,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:11:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:51,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 14:11:51,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:11:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-11 14:11:54,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:11:54,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-11 14:11:54,364 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:11:54,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-11 14:11:54,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-11 14:11:54,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 14:11:54,365 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 49 states. [2019-01-11 14:11:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:11:54,635 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2019-01-11 14:11:54,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-11 14:11:54,636 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2019-01-11 14:11:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:11:54,636 INFO L225 Difference]: With dead ends: 148 [2019-01-11 14:11:54,636 INFO L226 Difference]: Without dead ends: 99 [2019-01-11 14:11:54,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-11 14:11:54,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-11 14:11:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-11 14:11:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-11 14:11:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-11 14:11:54,640 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-11 14:11:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:11:54,640 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-11 14:11:54,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-11 14:11:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-11 14:11:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-11 14:11:54,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:11:54,641 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-11 14:11:54,641 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:11:54,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:11:54,641 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 47 times [2019-01-11 14:11:54,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:11:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:54,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:11:54,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:11:54,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:11:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:11:55,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-11 14:11:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:55,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:11:55,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:11:55,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:11:55,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:11:55,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:11:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:11:55,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:11:57,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-11 14:11:57,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:11:57,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:11:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-11 14:11:57,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:00,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2019-01-11 14:12:00,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:00,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-11 14:12:00,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:00,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-11 14:12:00,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-11 14:12:00,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 14:12:00,498 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 50 states. [2019-01-11 14:12:00,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:00,867 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2019-01-11 14:12:00,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-11 14:12:00,867 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2019-01-11 14:12:00,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:00,868 INFO L225 Difference]: With dead ends: 151 [2019-01-11 14:12:00,868 INFO L226 Difference]: Without dead ends: 101 [2019-01-11 14:12:00,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-11 14:12:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-11 14:12:00,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-11 14:12:00,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-11 14:12:00,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-11 14:12:00,874 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2019-01-11 14:12:00,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:00,874 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-11 14:12:00,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-11 14:12:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-11 14:12:00,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-11 14:12:00,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:00,875 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-11 14:12:00,875 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:00,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 48 times [2019-01-11 14:12:00,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:00,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:00,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:00,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 14:12:01,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:01,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:01,864 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:01,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:01,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:01,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:01,872 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:01,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:01,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:01,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:01,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 14:12:01,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:04,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-11 14:12:04,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:04,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-11 14:12:04,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:04,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-11 14:12:04,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-11 14:12:04,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-11 14:12:04,788 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 51 states. [2019-01-11 14:12:05,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:05,082 INFO L93 Difference]: Finished difference Result 154 states and 157 transitions. [2019-01-11 14:12:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-11 14:12:05,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2019-01-11 14:12:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:05,083 INFO L225 Difference]: With dead ends: 154 [2019-01-11 14:12:05,084 INFO L226 Difference]: Without dead ends: 103 [2019-01-11 14:12:05,084 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 [2019-01-11 14:12:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-11 14:12:05,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-11 14:12:05,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-11 14:12:05,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-11 14:12:05,088 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-11 14:12:05,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:05,089 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-11 14:12:05,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-11 14:12:05,089 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-11 14:12:05,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-11 14:12:05,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:05,089 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-11 14:12:05,089 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:05,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:05,090 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 49 times [2019-01-11 14:12:05,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:05,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:05,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:05,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:05,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-11 14:12:06,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:06,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:06,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:06,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:06,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:06,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:06,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:06,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:06,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:06,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-11 14:12:06,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2019-01-11 14:12:09,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:09,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-11 14:12:09,167 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:09,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-11 14:12:09,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-11 14:12:09,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 14:12:09,168 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 52 states. [2019-01-11 14:12:09,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:09,388 INFO L93 Difference]: Finished difference Result 157 states and 160 transitions. [2019-01-11 14:12:09,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-11 14:12:09,389 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2019-01-11 14:12:09,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:09,389 INFO L225 Difference]: With dead ends: 157 [2019-01-11 14:12:09,389 INFO L226 Difference]: Without dead ends: 105 [2019-01-11 14:12:09,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-11 14:12:09,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-11 14:12:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-11 14:12:09,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 14:12:09,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-11 14:12:09,395 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 102 [2019-01-11 14:12:09,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:09,395 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-11 14:12:09,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-11 14:12:09,395 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-11 14:12:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-11 14:12:09,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:09,396 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-11 14:12:09,396 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:09,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:09,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 50 times [2019-01-11 14:12:09,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:09,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:09,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:09,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 14:12:10,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:10,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:10,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:10,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:10,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:10,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:10,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:10,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:11,860 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-11 14:12:11,860 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:11,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:11,886 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 14:12:11,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-11 14:12:15,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:15,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-11 14:12:15,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:15,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-11 14:12:15,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-11 14:12:15,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 14:12:15,086 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 53 states. [2019-01-11 14:12:15,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:15,425 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2019-01-11 14:12:15,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-11 14:12:15,425 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2019-01-11 14:12:15,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:15,426 INFO L225 Difference]: With dead ends: 160 [2019-01-11 14:12:15,426 INFO L226 Difference]: Without dead ends: 107 [2019-01-11 14:12:15,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-11 14:12:15,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-11 14:12:15,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-11 14:12:15,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 14:12:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-11 14:12:15,433 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-11 14:12:15,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:15,433 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-11 14:12:15,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-11 14:12:15,434 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-11 14:12:15,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-11 14:12:15,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:15,435 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-11 14:12:15,435 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:15,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:15,436 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 51 times [2019-01-11 14:12:15,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:15,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:15,437 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:15,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:15,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-11 14:12:16,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:16,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:16,875 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:16,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:16,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:16,875 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:16,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:12:16,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:12:16,956 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:12:16,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:16,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:16,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-11 14:12:16,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 1326 trivial. 0 not checked. [2019-01-11 14:12:20,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:20,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-11 14:12:20,140 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:20,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-11 14:12:20,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-11 14:12:20,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 14:12:20,142 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 54 states. [2019-01-11 14:12:20,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:20,388 INFO L93 Difference]: Finished difference Result 163 states and 166 transitions. [2019-01-11 14:12:20,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-11 14:12:20,388 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2019-01-11 14:12:20,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:20,389 INFO L225 Difference]: With dead ends: 163 [2019-01-11 14:12:20,389 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 14:12:20,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-11 14:12:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 14:12:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-11 14:12:20,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-11 14:12:20,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-11 14:12:20,395 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2019-01-11 14:12:20,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:20,396 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-11 14:12:20,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-11 14:12:20,396 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-11 14:12:20,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-11 14:12:20,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:20,397 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-11 14:12:20,397 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:20,397 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 52 times [2019-01-11 14:12:20,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:20,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:12:20,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:20,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:22,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 14:12:22,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:22,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:22,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:22,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:22,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:22,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:22,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:22,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:12:22,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:22,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:22,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 14:12:22,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:12:25,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-11 14:12:25,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:12:25,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-11 14:12:25,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:12:25,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-11 14:12:25,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-11 14:12:25,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-11 14:12:25,377 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 55 states. [2019-01-11 14:12:25,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:12:25,630 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2019-01-11 14:12:25,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-11 14:12:25,631 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2019-01-11 14:12:25,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:12:25,632 INFO L225 Difference]: With dead ends: 166 [2019-01-11 14:12:25,632 INFO L226 Difference]: Without dead ends: 111 [2019-01-11 14:12:25,632 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 [2019-01-11 14:12:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-11 14:12:25,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-11 14:12:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-11 14:12:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-11 14:12:25,636 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-11 14:12:25,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:12:25,636 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-11 14:12:25,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-11 14:12:25,637 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-11 14:12:25,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-11 14:12:25,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:12:25,637 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-11 14:12:25,638 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:12:25,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:12:25,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 53 times [2019-01-11 14:12:25,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:12:25,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:25,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:12:25,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:12:25,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:12:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:12:26,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2019-01-11 14:12:26,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:26,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:12:26,897 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:12:26,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:12:26,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:12:26,897 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:12:26,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:12:26,907 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:12:28,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-11 14:12:28,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:12:28,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:12:28,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-01-11 14:12:28,420 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:12:28,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:12:28,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-11 14:14:34,282 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:14:34,283 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:934) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:215) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2019-01-11 14:14:34,288 INFO L168 Benchmark]: Toolchain (without parser) took 252381.13 ms. Allocated memory was 131.6 MB in the beginning and 779.6 MB in the end (delta: 648.0 MB). Free memory was 106.9 MB in the beginning and 529.0 MB in the end (delta: -422.1 MB). Peak memory consumption was 225.9 MB. Max. memory is 7.1 GB. [2019-01-11 14:14:34,290 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 131.6 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 14:14:34,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.08 ms. Allocated memory is still 131.6 MB. Free memory was 106.7 MB in the beginning and 105.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. [2019-01-11 14:14:34,291 INFO L168 Benchmark]: Boogie Preprocessor took 22.50 ms. Allocated memory is still 131.6 MB. Free memory was 105.1 MB in the beginning and 104.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 14:14:34,291 INFO L168 Benchmark]: RCFGBuilder took 362.24 ms. Allocated memory is still 131.6 MB. Free memory was 104.0 MB in the beginning and 94.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-01-11 14:14:34,292 INFO L168 Benchmark]: TraceAbstraction took 251954.71 ms. Allocated memory was 131.6 MB in the beginning and 779.6 MB in the end (delta: 648.0 MB). Free memory was 94.5 MB in the beginning and 529.0 MB in the end (delta: -434.5 MB). Peak memory consumption was 213.5 MB. Max. memory is 7.1 GB. [2019-01-11 14:14:34,295 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 131.6 MB. Free memory is still 108.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.08 ms. Allocated memory is still 131.6 MB. Free memory was 106.7 MB in the beginning and 105.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.50 ms. Allocated memory is still 131.6 MB. Free memory was 105.1 MB in the beginning and 104.0 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 362.24 ms. Allocated memory is still 131.6 MB. Free memory was 104.0 MB in the beginning and 94.7 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251954.71 ms. Allocated memory was 131.6 MB in the beginning and 779.6 MB in the end (delta: 648.0 MB). Free memory was 94.5 MB in the beginning and 529.0 MB in the end (delta: -434.5 MB). Peak memory consumption was 213.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000)Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...