java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:34:52,722 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:34:52,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:34:52,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:34:52,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:34:52,738 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:34:52,741 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:34:52,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:34:52,748 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:34:52,749 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:34:52,751 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:34:52,751 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:34:52,752 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:34:52,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:34:52,762 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:34:52,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:34:52,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:34:52,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:34:52,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:34:52,774 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:34:52,777 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:34:52,778 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:34:52,785 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:34:52,785 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:34:52,785 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:34:52,786 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:34:52,788 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:34:52,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:34:52,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:34:52,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:34:52,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:34:52,796 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:34:52,796 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:34:52,798 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:34:52,799 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:34:52,800 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:34:52,801 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:34:52,821 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:34:52,822 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:34:52,823 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:34:52,823 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:34:52,823 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:34:52,823 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:34:52,823 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:34:52,824 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:34:52,824 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:34:52,824 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:34:52,824 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:34:52,824 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:34:52,825 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:34:52,825 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:34:52,826 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:34:52,826 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:34:52,826 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:34:52,826 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:34:52,827 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:34:52,827 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:34:52,827 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:34:52,827 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:34:52,827 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:34:52,827 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:34:52,828 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:34:52,828 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:34:52,828 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:34:52,828 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:34:52,829 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:34:52,829 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:34:52,829 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:34:52,829 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:34:52,829 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:34:52,830 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:34:52,830 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:34:52,830 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:34:52,830 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:34:52,830 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:34:52,831 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:34:52,831 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:34:52,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:34:52,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:34:52,910 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:34:52,912 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:34:52,912 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:34:52,913 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl [2018-12-03 19:34:52,914 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/NeonAngel01.bpl' [2018-12-03 19:34:52,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:34:52,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:34:52,961 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:34:52,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:34:52,962 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:34:52,980 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:52,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:52,996 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 19:34:52,999 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 19:34:52,999 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 19:34:53,001 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:34:53,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:34:53,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:34:53,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:34:53,015 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,015 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,016 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,020 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... [2018-12-03 19:34:53,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:34:53,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:34:53,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:34:53,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:34:53,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:34:53,112 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 19:34:53,113 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 19:34:53,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 19:34:53,357 INFO L272 CfgBuilder]: Using library mode [2018-12-03 19:34:53,357 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:34:53,358 INFO L202 PluginConnector]: Adding new model NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:34:53 BoogieIcfgContainer [2018-12-03 19:34:53,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:34:53,359 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:34:53,359 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:34:53,362 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:34:53,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:34:52" (1/2) ... [2018-12-03 19:34:53,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69672076 and model type NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:34:53, skipping insertion in model container [2018-12-03 19:34:53,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NeonAngel01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:34:53" (2/2) ... [2018-12-03 19:34:53,366 INFO L112 eAbstractionObserver]: Analyzing ICFG NeonAngel01.bpl [2018-12-03 19:34:53,377 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:34:53,384 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:34:53,403 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:34:53,439 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:34:53,440 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:34:53,440 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:34:53,440 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:34:53,440 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:34:53,441 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:34:53,441 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:34:53,441 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:34:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 19:34:53,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 19:34:53,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:53,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 19:34:53,469 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:53,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:53,476 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 19:34:53,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:53,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:53,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:53,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:53,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:53,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:53,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:34:53,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 19:34:53,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:34:53,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:34:53,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:34:53,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:34:53,637 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 19:34:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:53,681 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 19:34:53,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:34:53,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 19:34:53,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:53,700 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:34:53,701 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 19:34:53,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 19:34:53,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 19:34:53,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 19:34:53,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 19:34:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 19:34:53,748 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 19:34:53,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:53,748 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 19:34:53,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:34:53,749 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 19:34:53,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 19:34:53,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:53,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 19:34:53,750 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:53,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:53,750 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 19:34:53,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:53,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:53,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:53,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:53,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:53,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:53,903 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:53,904 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 19:34:53,906 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 19:34:54,027 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:34:54,027 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:34:54,239 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:34:54,244 INFO L272 AbstractInterpreter]: Visited 4 different actions 26 times. Merged at 3 different actions 14 times. Widened at 1 different actions 6 times. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 19:34:54,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:54,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:34:54,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:54,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:54,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:54,321 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:54,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:54,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:54,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:54,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:54,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 19:34:54,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:54,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 19:34:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 19:34:54,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:34:54,561 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 19:34:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:54,606 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 19:34:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:34:54,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 19:34:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:54,608 INFO L225 Difference]: With dead ends: 8 [2018-12-03 19:34:54,608 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 19:34:54,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:34:54,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 19:34:54,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 19:34:54,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 19:34:54,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 19:34:54,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 19:34:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:54,613 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 19:34:54,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 19:34:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 19:34:54,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 19:34:54,615 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:54,615 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 19:34:54,615 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:54,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:54,616 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 19:34:54,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:54,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:54,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:54,619 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:54,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:54,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:54,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:54,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:54,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:54,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:54,718 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:54,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:54,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:54,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:34:54,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:54,740 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:54,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:54,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:54,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:54,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 19:34:54,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:54,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 19:34:54,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 19:34:54,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:34:54,868 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 19:34:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:54,936 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 19:34:54,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 19:34:54,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 19:34:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:54,938 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:34:54,938 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 19:34:54,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 19:34:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 19:34:54,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 19:34:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 19:34:54,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 19:34:54,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 19:34:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:54,942 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 19:34:54,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 19:34:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 19:34:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 19:34:54,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:54,943 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 19:34:54,943 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:54,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 19:34:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:54,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:54,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:54,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:54,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:55,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:55,177 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:55,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:55,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:55,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:55,195 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:55,195 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:55,231 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:55,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:55,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:55,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:55,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 19:34:55,400 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:55,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 19:34:55,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 19:34:55,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:34:55,402 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 19:34:55,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:55,452 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 19:34:55,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 19:34:55,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 19:34:55,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:55,454 INFO L225 Difference]: With dead ends: 10 [2018-12-03 19:34:55,454 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 19:34:55,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 19:34:55,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 19:34:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 19:34:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 19:34:55,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 19:34:55,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 19:34:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:55,459 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 19:34:55,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 19:34:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 19:34:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 19:34:55,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:55,460 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 19:34:55,460 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:55,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:55,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 19:34:55,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:55,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:55,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:55,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:55,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:55,565 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:55,565 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:55,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:55,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:55,566 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:55,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:55,576 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:55,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:55,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:55,599 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:55,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 19:34:55,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:55,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 19:34:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 19:34:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 19:34:55,769 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 19:34:55,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:55,797 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 19:34:55,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 19:34:55,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 19:34:55,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:55,800 INFO L225 Difference]: With dead ends: 11 [2018-12-03 19:34:55,800 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 19:34:55,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 19:34:55,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 19:34:55,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 19:34:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 19:34:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 19:34:55,804 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 19:34:55,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:55,805 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 19:34:55,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 19:34:55,805 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 19:34:55,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 19:34:55,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:55,806 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 19:34:55,807 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:55,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:55,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 19:34:55,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:55,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:55,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:55,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:55,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:55,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:55,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:55,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:55,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:55,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:55,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:55,931 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:55,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 19:34:55,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:55,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:55,981 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:55,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:56,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:56,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:56,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 19:34:56,464 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:56,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:34:56,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:34:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:34:56,465 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 19:34:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:56,495 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 19:34:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 19:34:56,496 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 19:34:56,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:56,497 INFO L225 Difference]: With dead ends: 12 [2018-12-03 19:34:56,497 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 19:34:56,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 19:34:56,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 19:34:56,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 19:34:56,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 19:34:56,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 19:34:56,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 19:34:56,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:56,501 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 19:34:56,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:34:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 19:34:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 19:34:56,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:56,502 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 19:34:56,503 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:56,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:56,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 19:34:56,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:56,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:56,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:56,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:56,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:56,709 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:56,710 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:56,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:56,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:56,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:56,719 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:56,720 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:56,728 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:56,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:56,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:56,737 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:56,737 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:56,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:56,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 19:34:56,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:56,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 19:34:56,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 19:34:56,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:34:56,926 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 19:34:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:56,971 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 19:34:56,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:34:56,972 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 19:34:56,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:56,972 INFO L225 Difference]: With dead ends: 13 [2018-12-03 19:34:56,972 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 19:34:56,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 19:34:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 19:34:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 19:34:56,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 19:34:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 19:34:56,978 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 19:34:56,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:56,978 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 19:34:56,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 19:34:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 19:34:56,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 19:34:56,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:56,979 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 19:34:56,980 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:56,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:56,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 19:34:56,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:56,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:56,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:56,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:57,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:57,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:57,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:57,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:57,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:57,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:57,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:57,160 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:57,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:57,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:57,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:57,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 19:34:57,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:57,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 19:34:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 19:34:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 19:34:57,526 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 19:34:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:57,550 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 19:34:57,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 19:34:57,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 19:34:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:57,553 INFO L225 Difference]: With dead ends: 14 [2018-12-03 19:34:57,553 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 19:34:57,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 19:34:57,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 19:34:57,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 19:34:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 19:34:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 19:34:57,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 19:34:57,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:57,557 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 19:34:57,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 19:34:57,557 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 19:34:57,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 19:34:57,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:57,558 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 19:34:57,558 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:57,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:57,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 19:34:57,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:57,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:57,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:57,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:57,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:57,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:57,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:57,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:57,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:57,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:57,730 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:57,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:57,738 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:57,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 19:34:57,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:57,752 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:57,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:58,021 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:58,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 19:34:58,044 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:58,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 19:34:58,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 19:34:58,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:34:58,045 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 19:34:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:58,083 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 19:34:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 19:34:58,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 19:34:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:58,084 INFO L225 Difference]: With dead ends: 15 [2018-12-03 19:34:58,084 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 19:34:58,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 19:34:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 19:34:58,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 19:34:58,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 19:34:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 19:34:58,089 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 19:34:58,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:58,089 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 19:34:58,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 19:34:58,089 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 19:34:58,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 19:34:58,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:58,090 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 19:34:58,090 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:58,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 19:34:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:58,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:58,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:58,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:58,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:58,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:58,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:58,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:58,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:58,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:58,231 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:34:58,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:34:58,243 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:34:58,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:58,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,254 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:58,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 19:34:58,512 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:58,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 19:34:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 19:34:58,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:34:58,514 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 19:34:58,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:58,550 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 19:34:58,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 19:34:58,551 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 19:34:58,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:58,552 INFO L225 Difference]: With dead ends: 16 [2018-12-03 19:34:58,552 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 19:34:58,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 19:34:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 19:34:58,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 19:34:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 19:34:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 19:34:58,556 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 19:34:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:58,557 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 19:34:58,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 19:34:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 19:34:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 19:34:58,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:58,558 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 19:34:58,558 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:58,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 19:34:58,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:58,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:58,559 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:58,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:58,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:58,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:58,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:58,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:58,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:58,700 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:58,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:58,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:34:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:58,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:58,727 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:58,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:59,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:59,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 19:34:59,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:59,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 19:34:59,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 19:34:59,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:34:59,043 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 19:34:59,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:59,103 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 19:34:59,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 19:34:59,104 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 19:34:59,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:59,104 INFO L225 Difference]: With dead ends: 17 [2018-12-03 19:34:59,104 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 19:34:59,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 19:34:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 19:34:59,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 19:34:59,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 19:34:59,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 19:34:59,108 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 19:34:59,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:59,108 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 19:34:59,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 19:34:59,109 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 19:34:59,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 19:34:59,109 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:59,109 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 19:34:59,109 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:59,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:59,110 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 19:34:59,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:59,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:59,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:34:59,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:59,111 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:34:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:59,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:59,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:34:59,307 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:34:59,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:34:59,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:34:59,307 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:34:59,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:34:59,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:34:59,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 19:34:59,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:34:59,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:34:59,408 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:59,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:34:59,798 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:34:59,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:34:59,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 19:34:59,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:34:59,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 19:34:59,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 19:34:59,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:34:59,822 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 19:34:59,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:34:59,871 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 19:34:59,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 19:34:59,871 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 19:34:59,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:34:59,871 INFO L225 Difference]: With dead ends: 18 [2018-12-03 19:34:59,872 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 19:34:59,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 19:34:59,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 19:34:59,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 19:34:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 19:34:59,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 19:34:59,875 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 19:34:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:34:59,875 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 19:34:59,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 19:34:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 19:34:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 19:34:59,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:34:59,876 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 19:34:59,876 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:34:59,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:34:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 19:34:59,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:34:59,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:59,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:34:59,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:34:59,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:34:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:00,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:00,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:00,206 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:00,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:00,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:00,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:00,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:00,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:00,236 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:00,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:00,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:00,245 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:00,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:00,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 19:35:00,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:00,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 19:35:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 19:35:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:35:00,899 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 19:35:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:01,059 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 19:35:01,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 19:35:01,060 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 19:35:01,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:01,061 INFO L225 Difference]: With dead ends: 19 [2018-12-03 19:35:01,061 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 19:35:01,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 19:35:01,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 19:35:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 19:35:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 19:35:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 19:35:01,070 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 19:35:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:01,070 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 19:35:01,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 19:35:01,071 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 19:35:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:35:01,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:01,071 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 19:35:01,072 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:01,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:01,072 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 19:35:01,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:01,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:01,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:01,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:01,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:01,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:01,379 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:01,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:01,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:01,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:01,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:01,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:01,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:01,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:01,391 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:01,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:01,410 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:01,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:01,859 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:01,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 19:35:01,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:01,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 19:35:01,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 19:35:01,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 19:35:01,884 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 19:35:01,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:01,914 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 19:35:01,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:35:01,915 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 19:35:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:01,915 INFO L225 Difference]: With dead ends: 20 [2018-12-03 19:35:01,916 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 19:35:01,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 19:35:01,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 19:35:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 19:35:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 19:35:01,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 19:35:01,921 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 19:35:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:01,921 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 19:35:01,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 19:35:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 19:35:01,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 19:35:01,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:01,922 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 19:35:01,922 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:01,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 19:35:01,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:01,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:01,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:01,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:02,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:02,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:02,119 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:02,119 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:02,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:02,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:02,128 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:02,128 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:02,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 19:35:02,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:02,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:02,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:03,514 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:03,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:03,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 19:35:03,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:03,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 19:35:03,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 19:35:03,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:35:03,536 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 19:35:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:03,571 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 19:35:03,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 19:35:03,571 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 19:35:03,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:03,572 INFO L225 Difference]: With dead ends: 21 [2018-12-03 19:35:03,572 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 19:35:03,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 19:35:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 19:35:03,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 19:35:03,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 19:35:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 19:35:03,579 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 19:35:03,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:03,580 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 19:35:03,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 19:35:03,580 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 19:35:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 19:35:03,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:03,581 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 19:35:03,581 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:03,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:03,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 19:35:03,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:03,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:03,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:03,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:03,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:04,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:04,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:04,118 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:04,118 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:04,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:04,118 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:04,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:04,166 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:04,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:04,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:04,176 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:04,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:04,980 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:05,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:05,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 19:35:05,000 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:05,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 19:35:05,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 19:35:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:35:05,001 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 19:35:05,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:05,200 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 19:35:05,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 19:35:05,200 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 19:35:05,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:05,201 INFO L225 Difference]: With dead ends: 22 [2018-12-03 19:35:05,201 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 19:35:05,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 19:35:05,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 19:35:05,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 19:35:05,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 19:35:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 19:35:05,205 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 19:35:05,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:05,205 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 19:35:05,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 19:35:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 19:35:05,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 19:35:05,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:05,206 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 19:35:05,206 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:05,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:05,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 19:35:05,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:05,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:05,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:05,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:05,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:06,037 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:06,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:06,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:06,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:06,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:06,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:06,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:06,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:06,053 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:06,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:06,083 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:06,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:06,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:06,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 19:35:06,817 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:06,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 19:35:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 19:35:06,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 19:35:06,819 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 19:35:06,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:06,856 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 19:35:06,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 19:35:06,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 19:35:06,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:06,858 INFO L225 Difference]: With dead ends: 23 [2018-12-03 19:35:06,858 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 19:35:06,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 19:35:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 19:35:06,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 19:35:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 19:35:06,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 19:35:06,863 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 19:35:06,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:06,864 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 19:35:06,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 19:35:06,864 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 19:35:06,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 19:35:06,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:06,865 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 19:35:06,865 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:06,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:06,865 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 19:35:06,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:06,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:06,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:06,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:06,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:07,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:07,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:07,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:07,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:07,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:07,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:07,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:07,093 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:07,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 19:35:07,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:07,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:07,869 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:07,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:08,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:08,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 19:35:08,899 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:08,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 19:35:08,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 19:35:08,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:35:08,900 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 19:35:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:08,942 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 19:35:08,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 19:35:08,943 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 19:35:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:08,944 INFO L225 Difference]: With dead ends: 24 [2018-12-03 19:35:08,944 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 19:35:08,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 19:35:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 19:35:08,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 19:35:08,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 19:35:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 19:35:08,948 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 19:35:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:08,949 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 19:35:08,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 19:35:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 19:35:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 19:35:08,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:08,950 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 19:35:08,950 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:08,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:08,950 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 19:35:08,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:08,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:08,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:08,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:08,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:09,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:09,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:09,742 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:09,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:09,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:09,742 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:09,752 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:09,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:09,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:09,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:09,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:09,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:10,430 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:10,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:10,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 19:35:10,450 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:10,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 19:35:10,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 19:35:10,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:35:10,452 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 19:35:10,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:10,546 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 19:35:10,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 19:35:10,546 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 19:35:10,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:10,547 INFO L225 Difference]: With dead ends: 25 [2018-12-03 19:35:10,547 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 19:35:10,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 19:35:10,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 19:35:10,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 19:35:10,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 19:35:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 19:35:10,551 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 19:35:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:10,552 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 19:35:10,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 19:35:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 19:35:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 19:35:10,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:10,553 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 19:35:10,553 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:10,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:10,554 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 19:35:10,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:10,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:10,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:10,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:10,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:11,179 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:11,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:11,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:11,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:11,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:11,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:11,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:11,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:11,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:11,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:11,213 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:11,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:11,735 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:11,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:11,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 19:35:11,758 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:11,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 19:35:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 19:35:11,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:35:11,759 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 19:35:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:11,800 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 19:35:11,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 19:35:11,801 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 19:35:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:11,802 INFO L225 Difference]: With dead ends: 26 [2018-12-03 19:35:11,802 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 19:35:11,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 19:35:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 19:35:11,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 19:35:11,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 19:35:11,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 19:35:11,807 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 19:35:11,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:11,807 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 19:35:11,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 19:35:11,808 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 19:35:11,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 19:35:11,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:11,808 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 19:35:11,809 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:11,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 19:35:11,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:11,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:11,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:11,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:12,203 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:12,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:12,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:12,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:12,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:12,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:12,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:12,214 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:12,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:35:12,306 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 19:35:12,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:12,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:12,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:12,849 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:12,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:12,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 19:35:12,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:12,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 19:35:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 19:35:12,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:35:12,873 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 19:35:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:12,944 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 19:35:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 19:35:12,945 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 19:35:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:12,946 INFO L225 Difference]: With dead ends: 27 [2018-12-03 19:35:12,946 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 19:35:12,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 19:35:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 19:35:12,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 19:35:12,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 19:35:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 19:35:12,950 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 19:35:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:12,951 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 19:35:12,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 19:35:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 19:35:12,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 19:35:12,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:12,952 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 19:35:12,952 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:12,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:12,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 19:35:12,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:12,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:12,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:12,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:13,258 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:13,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:13,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:13,258 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:13,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:13,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:13,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:13,268 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:35:13,268 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:35:13,281 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:35:13,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:35:13,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:13,292 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:13,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:14,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:14,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 19:35:14,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:14,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 19:35:14,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 19:35:14,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:35:14,034 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 19:35:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:14,077 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 19:35:14,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 19:35:14,080 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 19:35:14,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:14,081 INFO L225 Difference]: With dead ends: 28 [2018-12-03 19:35:14,081 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 19:35:14,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 19:35:14,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 19:35:14,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 19:35:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 19:35:14,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 19:35:14,086 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 19:35:14,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:14,086 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 19:35:14,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 19:35:14,086 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 19:35:14,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 19:35:14,087 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:14,087 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 19:35:14,087 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:14,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 19:35:14,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:14,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:14,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:35:14,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:14,089 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:14,375 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:14,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:14,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:14,375 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:14,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:14,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:14,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:14,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:14,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:35:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:14,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:35:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:14,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:35:15,108 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:15,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:35:15,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 19:35:15,127 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:35:15,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 19:35:15,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 19:35:15,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 19:35:15,129 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 19:35:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:35:15,214 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 19:35:15,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 19:35:15,215 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 19:35:15,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:35:15,216 INFO L225 Difference]: With dead ends: 29 [2018-12-03 19:35:15,216 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 19:35:15,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 19:35:15,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 19:35:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 19:35:15,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 19:35:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 19:35:15,221 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 19:35:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:35:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 19:35:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 19:35:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 19:35:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 19:35:15,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:35:15,223 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 19:35:15,223 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:35:15,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:35:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 19:35:15,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:35:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:35:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:35:15,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:35:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:35:15,633 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:35:15,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:15,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:35:15,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:35:15,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:35:15,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:35:15,635 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:35:15,644 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:35:15,644 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:06,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 19:36:06,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:06,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:06,431 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:06,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:07,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:07,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 19:36:07,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:07,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 19:36:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 19:36:07,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:36:07,635 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 19:36:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:07,722 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 19:36:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 19:36:07,723 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 19:36:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:07,724 INFO L225 Difference]: With dead ends: 30 [2018-12-03 19:36:07,724 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 19:36:07,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 19:36:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 19:36:07,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 19:36:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 19:36:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 19:36:07,729 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 19:36:07,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:07,729 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 19:36:07,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 19:36:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 19:36:07,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 19:36:07,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:07,730 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 19:36:07,730 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:07,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:07,731 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 19:36:07,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,732 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:07,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:07,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:08,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:08,226 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:08,226 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:08,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:08,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:08,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:08,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:08,244 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:08,270 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:08,271 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:08,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:08,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:09,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 19:36:09,021 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:09,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 19:36:09,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 19:36:09,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:36:09,023 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 19:36:09,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:09,057 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 19:36:09,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 19:36:09,058 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 19:36:09,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:09,059 INFO L225 Difference]: With dead ends: 31 [2018-12-03 19:36:09,059 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 19:36:09,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 19:36:09,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 19:36:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 19:36:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 19:36:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 19:36:09,064 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 19:36:09,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:09,064 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 19:36:09,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 19:36:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 19:36:09,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 19:36:09,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:09,065 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 19:36:09,066 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:09,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:09,066 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 19:36:09,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:09,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:09,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:09,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:09,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:09,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:09,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:09,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:09,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:09,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:09,432 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:09,450 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:09,458 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:09,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:10,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:10,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 19:36:10,812 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:10,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 19:36:10,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 19:36:10,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 19:36:10,814 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 19:36:10,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:10,851 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 19:36:10,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 19:36:10,852 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 19:36:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:10,852 INFO L225 Difference]: With dead ends: 32 [2018-12-03 19:36:10,852 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 19:36:10,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 19:36:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 19:36:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 19:36:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 19:36:10,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 19:36:10,857 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 19:36:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 19:36:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 19:36:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 19:36:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 19:36:10,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:10,859 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 19:36:10,859 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:10,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 19:36:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:10,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:10,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:10,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:11,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:11,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:11,997 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:11,997 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:11,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:11,997 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:12,007 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:12,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:36:19,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 19:36:19,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:19,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:19,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:20,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:20,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 19:36:20,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:20,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 19:36:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 19:36:20,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:36:20,490 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 19:36:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:20,679 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 19:36:20,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 19:36:20,680 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 19:36:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:20,680 INFO L225 Difference]: With dead ends: 33 [2018-12-03 19:36:20,680 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 19:36:20,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 19:36:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 19:36:20,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 19:36:20,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 19:36:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 19:36:20,686 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 19:36:20,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:20,686 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 19:36:20,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 19:36:20,686 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 19:36:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 19:36:20,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:20,687 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 19:36:20,687 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:20,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 19:36:20,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:20,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:20,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:20,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:21,106 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:21,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:21,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:21,107 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:21,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:21,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:21,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:21,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:36:21,117 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:36:21,136 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:36:21,136 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:36:21,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:21,146 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:21,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:22,140 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:22,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:22,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 19:36:22,160 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:22,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 19:36:22,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 19:36:22,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:36:22,162 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 19:36:22,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:22,211 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 19:36:22,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 19:36:22,211 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 19:36:22,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:22,212 INFO L225 Difference]: With dead ends: 34 [2018-12-03 19:36:22,212 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 19:36:22,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 19:36:22,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 19:36:22,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 19:36:22,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 19:36:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 19:36:22,217 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 19:36:22,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:22,218 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 19:36:22,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 19:36:22,218 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 19:36:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 19:36:22,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:22,219 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 19:36:22,219 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:22,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 19:36:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:22,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:36:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:22,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:23,644 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:23,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:23,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:23,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:23,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:23,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:23,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:23,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:23,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:36:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:23,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:36:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:23,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:36:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:24,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:36:24,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 19:36:24,625 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:36:24,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 19:36:24,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 19:36:24,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 19:36:24,627 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 19:36:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:36:24,709 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 19:36:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 19:36:24,710 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 19:36:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:36:24,710 INFO L225 Difference]: With dead ends: 35 [2018-12-03 19:36:24,711 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 19:36:24,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 19:36:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 19:36:24,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 19:36:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 19:36:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 19:36:24,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 19:36:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:36:24,719 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 19:36:24,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 19:36:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 19:36:24,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 19:36:24,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:36:24,719 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 19:36:24,720 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:36:24,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:36:24,720 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 19:36:24,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:36:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:36:24,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:36:24,721 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:36:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:36:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:36:25,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:25,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:36:25,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:36:25,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:36:25,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:36:25,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:36:25,206 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:36:25,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:37:32,415 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 19:37:32,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:32,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:32,462 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:32,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:33,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:33,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 19:37:33,920 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:33,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 19:37:33,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 19:37:33,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:37:33,921 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 19:37:33,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:33,967 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 19:37:33,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 19:37:33,968 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 19:37:33,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:33,968 INFO L225 Difference]: With dead ends: 36 [2018-12-03 19:37:33,969 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 19:37:33,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 19:37:33,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 19:37:33,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 19:37:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 19:37:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 19:37:33,973 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 19:37:33,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:33,973 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 19:37:33,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 19:37:33,973 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 19:37:33,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 19:37:33,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:33,974 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 19:37:33,974 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:33,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:33,974 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 19:37:33,974 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:33,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:33,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:33,975 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:34,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:34,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:34,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:34,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:34,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:34,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:34,870 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:37:34,871 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:37:34,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:37:34,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:37:34,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:34,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:35,931 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:35,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:35,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 19:37:35,950 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:35,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 19:37:35,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 19:37:35,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:37:35,951 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 19:37:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:36,026 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 19:37:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 19:37:36,026 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 19:37:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:36,027 INFO L225 Difference]: With dead ends: 37 [2018-12-03 19:37:36,027 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 19:37:36,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 19:37:36,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 19:37:36,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 19:37:36,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 19:37:36,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 19:37:36,032 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 19:37:36,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:36,032 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 19:37:36,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 19:37:36,032 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 19:37:36,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 19:37:36,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:36,033 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 19:37:36,033 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:36,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:36,033 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 19:37:36,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:36,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:37:36,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:36,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:36,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:36,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:36,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:36,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:36,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:36,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:36,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:36,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:37:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:36,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:37:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:36,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:37:37,635 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:37,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:37:37,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 19:37:37,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:37:37,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 19:37:37,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 19:37:37,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 19:37:37,657 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 19:37:37,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:37:37,730 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 19:37:37,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 19:37:37,731 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 19:37:37,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:37:37,732 INFO L225 Difference]: With dead ends: 38 [2018-12-03 19:37:37,732 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 19:37:37,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 19:37:37,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 19:37:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 19:37:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 19:37:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 19:37:37,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 19:37:37,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:37:37,737 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 19:37:37,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 19:37:37,737 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 19:37:37,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 19:37:37,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:37:37,737 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 19:37:37,738 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:37:37,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:37:37,738 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 19:37:37,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:37:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:37,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:37:37,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:37:37,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:37:37,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:37:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:37:38,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:38,471 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:37:38,471 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:37:38,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:37:38,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:37:38,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:37:38,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:37:38,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:38:50,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 19:38:50,034 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:50,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:50,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:52,171 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:52,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:52,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 19:38:52,177 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:52,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 19:38:52,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 19:38:52,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 19:38:52,178 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 19:38:52,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:52,264 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 19:38:52,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 19:38:52,265 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 19:38:52,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:52,266 INFO L225 Difference]: With dead ends: 39 [2018-12-03 19:38:52,266 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 19:38:52,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 19:38:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 19:38:52,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 19:38:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 19:38:52,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 19:38:52,271 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 19:38:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:52,271 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 19:38:52,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 19:38:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 19:38:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 19:38:52,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:52,272 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 19:38:52,272 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:52,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 19:38:52,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:52,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:52,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:52,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:52,928 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:52,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:52,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:52,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:52,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:52,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:52,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:52,937 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:38:52,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:38:52,963 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:38:52,963 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:38:52,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:52,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:54,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:54,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 19:38:54,297 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:54,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 19:38:54,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 19:38:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:38:54,299 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 19:38:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:54,386 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 19:38:54,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 19:38:54,386 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 19:38:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:54,387 INFO L225 Difference]: With dead ends: 40 [2018-12-03 19:38:54,387 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 19:38:54,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 19:38:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 19:38:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 19:38:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 19:38:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 19:38:54,391 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 19:38:54,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:54,391 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 19:38:54,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 19:38:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 19:38:54,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 19:38:54,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:54,392 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 19:38:54,392 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:54,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:54,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 19:38:54,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:54,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:54,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:38:54,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:54,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:54,984 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:54,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:54,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:54,984 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:54,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:54,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:54,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:54,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:54,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:38:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:55,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:38:55,022 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:55,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:38:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:56,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:38:56,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 19:38:56,655 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:38:56,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 19:38:56,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 19:38:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 19:38:56,656 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 19:38:56,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:38:56,724 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 19:38:56,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 19:38:56,725 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 19:38:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:38:56,725 INFO L225 Difference]: With dead ends: 41 [2018-12-03 19:38:56,726 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 19:38:56,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 19:38:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 19:38:56,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 19:38:56,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 19:38:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 19:38:56,731 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 19:38:56,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:38:56,732 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 19:38:56,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 19:38:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 19:38:56,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 19:38:56,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:38:56,732 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 19:38:56,733 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:38:56,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:38:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 19:38:56,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:38:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:56,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:38:56,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:38:56,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:38:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:38:57,324 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:38:57,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:57,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:38:57,325 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:38:57,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:38:57,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:38:57,325 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:38:57,335 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:38:57,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:40:18,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 19:40:18,731 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:18,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:18,864 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:18,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:20,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:20,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 19:40:20,291 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:20,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 19:40:20,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 19:40:20,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:40:20,292 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 19:40:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:20,352 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 19:40:20,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 19:40:20,353 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 19:40:20,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:20,353 INFO L225 Difference]: With dead ends: 42 [2018-12-03 19:40:20,353 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 19:40:20,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 19:40:20,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 19:40:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 19:40:20,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 19:40:20,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 19:40:20,357 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 19:40:20,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:20,357 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 19:40:20,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 19:40:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 19:40:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 19:40:20,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:20,357 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 19:40:20,358 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:20,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:20,358 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 19:40:20,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:20,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:20,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:20,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:20,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:21,053 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:21,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:21,053 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:21,053 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:21,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:21,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:21,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:21,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:40:21,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:40:21,083 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:40:21,083 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:40:21,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:21,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:22,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:22,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 19:40:22,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:22,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 19:40:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 19:40:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 19:40:22,872 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 19:40:22,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:22,932 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 19:40:22,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 19:40:22,933 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 19:40:22,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:22,933 INFO L225 Difference]: With dead ends: 43 [2018-12-03 19:40:22,933 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 19:40:22,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 19:40:22,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 19:40:22,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 19:40:22,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 19:40:22,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 19:40:22,936 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 19:40:22,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:22,937 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 19:40:22,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 19:40:22,937 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 19:40:22,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 19:40:22,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:22,938 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 19:40:22,938 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:22,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:22,938 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 19:40:22,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:22,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:40:22,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:22,939 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:23,553 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:23,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:23,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:23,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:23,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:23,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:23,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:23,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:23,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:40:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:23,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:40:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:23,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:40:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:25,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:40:25,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 19:40:25,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:40:25,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 19:40:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 19:40:25,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 19:40:25,145 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 19:40:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:40:25,208 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 19:40:25,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 19:40:25,209 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 19:40:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:40:25,209 INFO L225 Difference]: With dead ends: 44 [2018-12-03 19:40:25,210 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 19:40:25,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 19:40:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 19:40:25,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 19:40:25,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 19:40:25,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 19:40:25,213 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 19:40:25,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:40:25,213 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 19:40:25,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 19:40:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 19:40:25,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 19:40:25,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:40:25,214 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 19:40:25,214 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:40:25,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:40:25,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 19:40:25,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:40:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:25,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:40:25,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:40:25,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:40:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:40:25,841 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:40:25,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:25,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:40:25,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:40:25,841 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:40:25,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:40:25,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:40:25,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:40:25,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:41:49,557 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 19:41:49,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:49,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:49,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:51,418 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:51,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 19:41:51,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:51,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 19:41:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 19:41:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 19:41:51,426 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 19:41:51,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:51,489 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 19:41:51,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 19:41:51,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 19:41:51,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:51,490 INFO L225 Difference]: With dead ends: 45 [2018-12-03 19:41:51,490 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 19:41:51,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 19:41:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 19:41:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 19:41:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 19:41:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 19:41:51,494 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 19:41:51,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:51,494 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 19:41:51,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 19:41:51,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 19:41:51,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 19:41:51,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:51,495 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 19:41:51,495 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:51,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 19:41:51,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:51,496 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:51,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:51,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:52,143 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:52,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:52,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:52,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:52,143 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:52,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:52,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:52,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:41:52,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:41:52,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:41:52,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:41:52,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:52,186 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:52,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:53,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:53,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 19:41:53,890 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:53,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 19:41:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 19:41:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:41:53,892 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 19:41:53,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:53,941 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 19:41:53,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 19:41:53,942 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 19:41:53,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:53,942 INFO L225 Difference]: With dead ends: 46 [2018-12-03 19:41:53,943 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 19:41:53,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 19:41:53,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 19:41:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 19:41:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 19:41:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 19:41:53,945 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 19:41:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:53,946 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 19:41:53,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 19:41:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 19:41:53,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 19:41:53,946 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:53,946 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 19:41:53,946 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:53,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 19:41:53,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:53,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:53,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:41:53,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:53,948 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:54,631 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:54,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:54,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:54,632 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:54,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:54,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:54,632 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:54,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:54,642 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:41:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:54,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:41:54,677 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:54,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:41:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:56,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:41:56,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 19:41:56,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:41:56,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 19:41:56,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 19:41:56,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 19:41:56,430 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 19:41:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:41:56,521 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 19:41:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 19:41:56,521 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 19:41:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:41:56,522 INFO L225 Difference]: With dead ends: 47 [2018-12-03 19:41:56,522 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 19:41:56,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 19:41:56,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 19:41:56,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 19:41:56,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 19:41:56,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 19:41:56,526 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 19:41:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:41:56,526 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 19:41:56,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 19:41:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 19:41:56,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 19:41:56,527 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:41:56,527 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 19:41:56,527 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:41:56,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:41:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 19:41:56,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:41:56,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:56,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:41:56,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:41:56,529 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:41:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:41:58,398 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:41:58,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:58,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:41:58,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:41:58,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:41:58,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:41:58,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:41:58,407 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:41:58,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:44:04,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 19:44:04,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:04,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:04,678 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:04,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:06,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:06,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 19:44:06,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:06,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 19:44:06,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 19:44:06,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:44:06,538 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 19:44:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:06,613 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 19:44:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 19:44:06,614 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 19:44:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:06,614 INFO L225 Difference]: With dead ends: 48 [2018-12-03 19:44:06,614 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 19:44:06,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 19:44:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 19:44:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 19:44:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 19:44:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 19:44:06,617 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 19:44:06,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:06,618 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 19:44:06,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 19:44:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 19:44:06,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 19:44:06,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:06,618 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 19:44:06,618 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:06,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:06,619 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 19:44:06,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:06,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:06,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:06,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:06,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:07,368 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:07,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:07,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:07,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:07,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:07,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:07,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:44:07,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:44:07,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:44:07,403 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:44:07,403 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:44:07,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:07,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:09,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:09,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 19:44:09,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:09,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 19:44:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 19:44:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 19:44:09,430 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 19:44:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:09,481 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 19:44:09,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 19:44:09,481 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 19:44:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:09,482 INFO L225 Difference]: With dead ends: 49 [2018-12-03 19:44:09,482 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 19:44:09,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 19:44:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 19:44:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 19:44:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 19:44:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 19:44:09,486 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 19:44:09,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:09,486 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 19:44:09,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 19:44:09,486 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 19:44:09,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 19:44:09,487 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:09,487 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 19:44:09,487 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:09,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 19:44:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:09,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:44:09,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:09,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:09,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:10,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:10,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:10,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:10,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:10,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:10,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:44:10,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:10,283 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:44:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:10,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:44:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:10,318 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:44:12,269 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:12,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:44:12,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 19:44:12,288 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:44:12,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 19:44:12,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 19:44:12,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 19:44:12,289 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 19:44:12,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:44:12,426 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 19:44:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 19:44:12,427 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 19:44:12,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:44:12,428 INFO L225 Difference]: With dead ends: 50 [2018-12-03 19:44:12,428 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 19:44:12,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 19:44:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 19:44:12,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 19:44:12,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 19:44:12,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 19:44:12,431 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 19:44:12,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:44:12,431 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 19:44:12,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 19:44:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 19:44:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 19:44:12,432 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:44:12,432 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 19:44:12,432 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:44:12,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:44:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 19:44:12,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:44:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:12,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:44:12,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:44:12,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:44:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:44:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:44:13,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:13,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:44:13,212 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:44:13,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:44:13,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:44:13,212 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:44:13,220 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:44:13,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:46:30,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 19:46:30,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:32,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:32,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:34,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:34,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 19:46:34,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:34,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 19:46:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 19:46:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:46:34,719 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 19:46:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:34,773 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 19:46:34,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 19:46:34,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 19:46:34,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:34,774 INFO L225 Difference]: With dead ends: 51 [2018-12-03 19:46:34,774 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 19:46:34,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 19:46:34,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 19:46:34,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 19:46:34,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 19:46:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 19:46:34,778 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 19:46:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:34,778 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 19:46:34,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 19:46:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 19:46:34,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 19:46:34,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:34,779 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 19:46:34,779 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:34,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 19:46:34,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:34,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:34,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:34,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:35,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:35,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:35,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:35,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:35,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:35,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:35,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:46:35,598 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:46:35,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:46:35,624 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:46:35,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:46:35,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:35,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:37,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:37,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:37,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 19:46:37,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:37,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 19:46:37,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 19:46:37,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:46:37,817 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 19:46:38,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:38,144 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 19:46:38,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 19:46:38,145 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 19:46:38,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:38,146 INFO L225 Difference]: With dead ends: 52 [2018-12-03 19:46:38,146 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 19:46:38,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 19:46:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 19:46:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 19:46:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 19:46:38,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 19:46:38,151 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 19:46:38,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:38,151 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 19:46:38,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 19:46:38,151 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 19:46:38,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 19:46:38,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:38,152 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 19:46:38,152 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:38,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 19:46:38,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:38,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:46:38,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:38,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:39,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:39,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:39,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:39,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:39,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:39,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:39,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:46:39,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:39,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:46:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:39,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:46:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:39,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:46:41,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:41,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:46:41,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 19:46:41,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:46:41,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 19:46:41,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 19:46:41,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 19:46:41,429 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 19:46:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:46:41,517 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 19:46:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 19:46:41,517 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 19:46:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:46:41,518 INFO L225 Difference]: With dead ends: 53 [2018-12-03 19:46:41,518 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 19:46:41,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 19:46:41,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 19:46:41,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 19:46:41,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 19:46:41,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 19:46:41,522 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 19:46:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:46:41,522 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 19:46:41,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 19:46:41,522 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 19:46:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 19:46:41,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:46:41,523 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 19:46:41,523 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:46:41,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:46:41,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 19:46:41,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:46:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:46:41,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:46:41,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:46:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:46:42,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:46:42,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:42,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:46:42,697 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:46:42,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:46:42,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:46:42,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:46:42,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:46:42,706 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:48:40,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 19:48:40,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:48:41,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:48:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:41,107 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:48:43,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:43,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:48:43,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 19:48:43,519 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:48:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 19:48:43,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 19:48:43,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:48:43,520 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 19:48:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:48:43,594 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 19:48:43,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 19:48:43,600 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 19:48:43,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:48:43,600 INFO L225 Difference]: With dead ends: 54 [2018-12-03 19:48:43,600 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 19:48:43,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 19:48:43,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 19:48:43,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 19:48:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 19:48:43,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 19:48:43,605 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 19:48:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:48:43,605 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 19:48:43,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 19:48:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 19:48:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 19:48:43,606 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:48:43,606 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 19:48:43,606 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:48:43,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:48:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 19:48:43,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:48:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:43,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:48:43,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:43,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:48:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:44,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:44,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:44,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:48:44,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:48:44,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:48:44,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:44,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:48:44,512 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:48:44,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:48:44,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:48:44,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:48:44,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:48:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:44,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:48:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:46,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:48:46,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 19:48:46,979 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:48:46,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 19:48:46,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 19:48:46,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 19:48:46,981 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 19:48:47,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:48:47,105 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 19:48:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 19:48:47,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 19:48:47,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:48:47,106 INFO L225 Difference]: With dead ends: 55 [2018-12-03 19:48:47,106 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 19:48:47,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 19:48:47,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 19:48:47,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 19:48:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 19:48:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 19:48:47,110 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 19:48:47,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:48:47,110 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 19:48:47,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 19:48:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 19:48:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 19:48:47,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:48:47,111 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 19:48:47,111 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:48:47,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:48:47,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 19:48:47,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:48:47,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:47,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:48:47,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:47,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:48:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:48,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:48,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:48,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:48:48,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:48:48,075 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:48:48,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:48,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:48:48,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:48:48,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:48:48,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:48,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:48:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:48,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:48:50,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:50,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 19:48:50,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 19:48:50,900 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:48:50,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 19:48:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 19:48:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 19:48:50,901 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 19:48:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:48:50,980 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 19:48:50,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 19:48:50,980 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 19:48:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:48:50,981 INFO L225 Difference]: With dead ends: 56 [2018-12-03 19:48:50,981 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 19:48:50,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 19:48:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 19:48:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 19:48:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 19:48:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 19:48:50,984 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 19:48:50,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:48:50,984 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 19:48:50,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 19:48:50,984 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 19:48:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 19:48:50,985 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:48:50,985 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 19:48:50,985 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:48:50,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:48:50,985 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 19:48:50,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:48:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:50,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:48:50,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:48:50,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:48:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:48:52,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:48:52,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:52,108 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 19:48:52,108 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:48:52,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:48:52,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:48:52,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:48:52,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:48:52,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP)